1.题目描述
打乱一个没有重复元素的数组。
示例:
// 以数字集合 1, 2 和 3 初始化数组。
int[] nums = {1,2,3};
Solution solution = new Solution(nums);// 打乱数组 [1,2,3] 并返回结果。任何 [1,2,3]的排列返回的概率应该相同。
solution.shuffle();// 重设数组到它的初始状态[1,2,3]。
solution.reset();// 随机返回数组[1,2,3]打乱后的结果。
solution.shuffle();
2.解题思路
3.代码实现
class Solution(object):
def __init__(self, nums):
"""
:type nums: List[int]
"""
self.array = nums
# 注意这里是值传递
self.original =nums[:]
def reset(self):
"""
Resets the array to its original configuration and return it.
:rtype: List[int]
"""
return self.original
def shuffle(self):
"""
Returns a random shuffling of the array.
:rtype: List[int]
"""
for i in range(len(self.array)):
index = random.randint(i,len(self.array)-1)
self.array[i], self.array[index] = self.array[index], self.array[i]
return self.array
# Your Solution object will be instantiated and called as such:
# obj = Solution(nums)
# param_1 = obj.reset()
# param_2 = obj.shuffle()
附上: