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();
参考资料:here。
这道题的关键在于如何快速的生成随机序列。我们这里用到了LeetCode官方解答中使用的方法:Fisher-Yates算法。
class Solution {
private:
vector<int> ori;
public:
Solution(vector<int>& nums) {
ori = nums;
}
/** Resets the array to its original configuration and return it. */
vector<int> reset() {
return ori;
}
/** Returns a random shuffling of the array. */
vector<int> shuffle() {
vector<int> tmp = ori;
for (int i = 0; i < tmp.size(); i++) {
int r = rand() % (tmp.size() - i) + i;
swap(tmp[i], tmp[r]);
}
return tmp;
}
};
/**
* 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();
*/