-
Notifications
You must be signed in to change notification settings - Fork 70
/
res.js
69 lines (57 loc) · 1.62 KB
/
res.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
63
64
65
66
67
68
69
// 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();
/**
* res.js
* @authors Joe Jiang (hijiangtao@gmail.com)
* @date 2017-02-28 23:12:37
* @version $Id$
*
* @param {number[]} nums
*/
let Solution = function(nums) {
this.nums = nums;
this.length = nums.length;
};
/**
* 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 shufflelist = []
for (let i=0; i<this.length; i++) {
shufflelist.push(this.nums[i]);
}
for (let i=0; i<this.length; i++) {
let random = (Math.floor(Math.random()*this.length) + i) % this.length,
temp = 0;
if (random === i) {
continue;
}
temp = shufflelist[i];
shufflelist[i] = shufflelist[random];
shufflelist[random] = temp;
}
return shufflelist;
};
/**
* 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()
*/