LeetCode ---- Shuffle an Array

打乱一个没有重复元素的数组。

示例:

// 以数字集合 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();

注意： HashSet和HashMap对int是有排序的。

class Solution {

    int[] nums;
    int[] temp;

    public Solution(int[] nums) {
        this.nums = nums;
        temp = nums.clone();
    }

    /** Resets the array to its original configuration and return it. */
    public int[] reset() {
        return temp;
    }

    /** Returns a random shuffling of the array. */
    public int[] shuffle() {
        int[] integers = randomSet(nums.length);
        for (int i = 0; i < integers.length; i++) {
            nums[integers[i]] = temp[i];
        }
        return nums;
    }

    int[] randomSet(int n) {
        int[] index = new int[n];
        IntStream.range(0, n).forEach(i -> index[i] = -1);

        for (int i = 0; i < n; i++) {
            int random = (int)(Math.random() * n);
            while (isExistInArrays(index, random)) {
                random = (int)(Math.random() * n);
            }
            index[i] = random;
        }

        return index;
    }

    private boolean isExistInArrays(int[] index, int random) {
        return Arrays.stream(index).anyMatch(id -> id == random);
    }
}

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