-
Notifications
You must be signed in to change notification settings - Fork 40
/
ShuffleAnArray.js
62 lines (56 loc) · 1.52 KB
/
ShuffleAnArray.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
// Source : https://leetcode.com/problems/shuffle-an-array
// Author : Dean Shi
// Date : 2017-09-05
/***************************************************************************************
*
* Shuffle a set of numbers without duplicates.
*
* Example:
*
* // Init an array with set 1, 2, and 3.
* int[] nums = {1,2,3};
* Solution solution = new Solution(nums);
*
* // Shuffle the array [1,2,3] and return its result. Any permutation of [1,2,3] must
* equally likely to be returned.
* solution.shuffle();
*
* // Resets the array back to its original configuration [1,2,3].
* solution.reset();
*
* // Returns the random shuffling of array [1,2,3].
* solution.shuffle();
*
*
***************************************************************************************/
/**
* @param {number[]} nums
*/
var Solution = function(nums) {
this.nums = nums
};
/**
* Resets the array to its original configuration and return it.
* @return {number[]}
*/
Solution.prototype.reset = function() {
return this.nums
};
/**
* Returns a random shuffling of the array.
* @return {number[]}
*/
Solution.prototype.shuffle = function() {
let i, count = this.nums.length, nums = this.nums.slice()
while (count) {
i = Math.floor(Math.random() * count--);
[nums[i], nums[count]] = [nums[count], nums[i]]
}
return nums
};
/**
* Your Solution object will be instantiated and called as such:
* var obj = Object.create(Solution).createNew(nums)
* var param_1 = obj.reset()
* var param_2 = obj.shuffle()
*/