Shuffle a set of numbers without duplicates.
Example:
Init an array with set 1, 2, and 3.int[] Nums = {n/a}; Solution solution = new solution (nums);//Shuffle the array [] and return its result. Any permutation of [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:
def __init__(self, nums):
"""
:type nums: List[int]
"""
self.origin = nums[:]
self.list = nums
def reset(self):
"""
Resets the array to its original configuration and return it.
:rtype: List[int]
"""
self.list = self.origin[:]
return self.origin
def shuffle(self):
"""
Returns a random shuffling of the array.
:rtype: List[int]
"""
random.shuffle(self.list)
return self.list
# Your Solution object will be instantiated and called as such:
# obj = Solution(nums)
# param_1 = obj.reset()
# param_2 = obj.shuffle()
From for notes (Wiz)
384. Shuffle an array random play