384. Shuffle an Array_soul2233445566-优快云博客

博客提及对无重复数字集合进行洗牌操作，并给出示例，但未详细说明实现方法。主要围绕信息技术领域中对数字集合的处理。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

class Solution {
    
    int[] nums;
        
    public Solution(int[] nums) {
        this.nums = nums;
    }
    
    /** Resets the array to its original configuration and return it. */
    public int[] reset() {
        return this.nums;
    }
    
    /** Returns a random shuffling of the array. */
    //对于每个位置，它是任意一个数的概率都相同
    public int[] shuffle() {
        int[] shuffle = nums.clone();
        for(int j = 1;j<shuffle.length;j++){
            int i = random.nextInt(0,j+1);//i必须有等于j的机会
            int t = shuffle[i];
            shuffle[i] = shuffle[j];
            shuffle[j] = t;
        }
        return shuffle;
    }
}

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