LeetCode 384. Shuffle an Array

Shuffle an Array

Medium

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

题意

实现数组的shuffle方法

思路

借鉴Python中的shuffle，遍历数组每一个位置，将该位置的数字与此位置之前（包含此位置的数字）调换。

代码

class Solution {
    private int[] origin;
    private int length;
    private Random rand;

    public Solution(int[] nums) {
        origin = nums;
        length = origin.length;
        rand = new Random();
    }
    
    /** Resets the array to its original configuration and return it. */
    public int[] reset() {
        return origin;
    }
    
    /** Returns a random shuffling of the array. */
    public int[] shuffle() {
        int[] shuf = origin.clone();
        for (int i=1; i<length; ++i) {
            int r = rand.nextInt(i+1);
            int tmp = shuf[r];
            shuf[r] = shuf[i];
            shuf[i] = tmp;
        }
        return shuf;
    }
}

/**
 * Your Solution object will be instantiated and called as such:
 * Solution obj = new Solution(nums);
 * int[] param_1 = obj.reset();
 * int[] param_2 = obj.shuffle();
 */

附

Python中random.shuffle的实现

def shuffle(self, x, random=None):
   """x, random=random.random -> shuffle list x in place; return None.

   Optional arg random is a 0-argument function returning a random
   float in [0.0, 1.0); by default, the standard random.random.

   """

   if random is None:
       random = self.random
   _int = int
   for i in reversed(xrange(1, len(x))):
       # pick an element in x[:i+1] with which to exchange x[i]
       j = _int(random() * (i+1))
       x[i], x[j] = x[j], x[i]