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

這個(gè)用到了洗牌算法：
1）將第1個(gè)元素與n個(gè)元素中的任意一個(gè)交換(包括自己)。這時(shí)結(jié)果中第1個(gè)元素已經(jīng)確定。
2）將第2個(gè)元素與n-1個(gè)元素中作任意一個(gè)交換(包括自己)。
3）重復(fù)上面步驟，直到剩1個(gè)元素為止。
這樣就可以返回隨機(jī)排列的數(shù)組了。

public class Solution {
    private int[] original;
    private Random rng = new Random();
    private int[] copy;
    private int num;
    public Solution(int[] nums) {
        original = nums;
        copy=original.clone();
        num=original.length;
    }
    
    /** Resets the array to its original configuration and return it. */
    public int[] reset() {
        return original;
    }
    
    /** Returns a random shuffling of the array. */
    public int[] shuffle() {
        int n = num;
        while(n>1) {
            n--;
            int k = rng.nextInt(n + 1);
            int value = copy[k];
            copy[k] = copy[n];
            copy[n] = value;
        }
        return copy;
    }
}