384. Shuffle an Array

最新推荐文章于 2020-04-12 08:34:05 发布

转载最新推荐文章于 2020-04-12 08:34:05 发布 · 100 阅读

本文介绍了一个使用C++实现的数组随机排列算法。该算法能够对不含重复元素的数组进行随机洗牌，并能将数组恢复到初始状态。通过实例演示了如何初始化数组、执行随机排列以及重置数组。

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 {
    vector<int> nums;
public:
    Solution(vector<int> nums) {
        this->nums = nums;
        srand((unsigned)time(0));
    }
    
    /** Resets the array to its original configuration and return it. */
    vector<int> reset() {
        return nums;
    }
    
    /** Returns a random shuffling of the array. */
    vector<int> shuffle() {
        vector<int> res(nums.begin(), nums.end());
        for(int i=0; i<res.size(); i++)
            swap(res[i],res[rand()%res.size()]);
        return res;
    }
};

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