【leetcode】384. Shuffle an Array【M】

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();

Subscribe to see which companies asked this question

python有个自带算法，shuffle，直接用。。

class Solution(object):    def __init__(self, nums):        self.origin = nums        #self.res = nums        """                :type nums: List[int]        :type size: int        """            def reset(self):        #self.res = self.origin        return self.origin        """        Resets the array to its original configuration and return it.        :rtype: List[int]        """            def shuffle(self):        res = self.origin[:]        random.shuffle(res)                return res        """        Returns a random shuffling of the array.        :rtype: List[int]        """        # Your Solution object will be instantiated and called as such:# obj = Solution(nums)# param_1 = obj.reset()# param_2 = obj.shuffle()