LeetCode-384. Shuffle an Array [C++][Java]

LeetCode-384. Shuffle an Arrayhttps://leetcode.com/problems/shuffle-an-array/

题目描述

Given an integer array nums, design an algorithm to randomly shuffle the array. All permutations of the array should be equally likely as a result of the shuffling.

Implement the Solution class:

• Solution(int[] nums) Initializes the object with the integer array nums.
• int[] reset() Resets the array to its original configuration and returns it.
• int[] shuffle() Returns a random shuffling of the array.

Example 1:

Input
["Solution", "shuffle", "reset", "shuffle"]
[[[1, 2, 3]], [], [], []]
Output
[null, [3, 1, 2], [1, 2, 3], [1, 3, 2]]

Explanation
Solution solution = new Solution([1, 2, 3]);
solution.shuffle();    // Shuffle the array [1,2,3] and return its result.
                       // Any permutation of [1,2,3] must be equally likely to be returned.
                       // Example: return [3, 1, 2]
solution.reset();      // Resets the array back to its original configuration [1,2,3]. Return [1, 2, 3]
solution.shuffle();    // Returns the random shuffling of array [1,2,3]. Example: return [1, 3, 2]

Constraints:

• 1 <= nums.length <= 200
• -10^6 <= nums[i] <= 10^6
• All the elements of nums are unique.
• At most 5 * 104 calls in total will be made to reset and shuffle.

解题思路

【C++】

class Solution {
    vector<int> origin;
public:
    Solution(vector<int>& nums) : origin(std::move(nums)) {}
    
    vector<int> reset() {
        return origin;
    }
    
    vector<int> shuffle() {
        vector<int> shuffled(origin);
        int n = origin.size();
        // 可以使用反向或者正向洗牌，效果相同。
        // 反向洗牌：
        for (int i = n - 1; i >= 0; --i) {
            swap(shuffled[i], shuffled[rand() % (i + 1)]);
        }
        // 正向洗牌：
        // for (int i = 0; i < n; ++i) {
        //     int pos = rand() % (n - i);
        //     swap(shuffled[i], shuffled[i+pos]);
        // }
        return shuffled;
    }
};

/**
 * Your Solution object will be instantiated and called as such:
 * Solution* obj = new Solution(nums);
 * vector<int> param_1 = obj->reset();
 * vector<int> param_2 = obj->shuffle();
 */

【Java】

class Solution {
    int[] nums;
    List<Integer> numsList;

    public Solution(int[] nums) {
        this.nums = nums;
        numsList = new ArrayList<>();
        for(int i=0;i<nums.length;i++){
           numsList.add(nums[i]);
        }
    }
    
    public int[] reset() {
        numsList = new ArrayList<>();
        for(int i=0;i<nums.length;i++){
            numsList.add(nums[i]);
        }
        return this.nums;
    }
    
    public int[] shuffle() {
        List<Integer> shuffled = new ArrayList<>();
        while(numsList.size()!=0){
            int rand =(int)( Math.random() * numsList.size());
            shuffled.add(numsList.get(rand));
            numsList.remove(rand);
        }
        this.reset();
        return shuffled.stream().mapToInt(i->i).toArray();
    }
}

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

参考文献

【1】Fisher-Yates 洗牌算法_平平无奇的名字的博客-CSDN博客