-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathShuffleArray.py
38 lines (30 loc) · 934 Bytes
/
ShuffleArray.py
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
'''
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();
'''
import random
class Solution(object):
def __init__(self, nums):
self.nums = nums
def reset(self):
return self.nums
def shuffle(self):
output = self.nums[:]
n = len(output)
for i in xrange(n):
_id = random.randint(i, n - 1)
output[i], output[_id] = output[_id], output[i]
return output
if __name__ == "__main__":
obj = Solution([1,2,3])
param_1 = obj.reset()
print obj.shuffle()