-
Notifications
You must be signed in to change notification settings - Fork 155
/
Copy pathshuffle-an-array.js
55 lines (49 loc) · 1.09 KB
/
shuffle-an-array.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
/**
* Shuffle an Array
*
* 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();
*/
class Solution {
/**
* @param {number[]} nums
*/
constructor(nums) {
this.nums = nums;
}
/**
* Resets the array to its original configuration and return it.
* @return {number[]}
*/
reset() {
return this.nums;
}
/**
* Returns a random shuffling of the array.
* @return {number[]}
*/
shuffle() {
const rand = this.nums.slice(0);
for (let i = 0; i < this.nums.length; i++) {
const r = Math.floor(Math.random() * (i + 1));
rand[i] = rand[r];
rand[r] = this.nums[i];
}
return rand;
}
}
export { Solution };