打乱一个没有重复元素的数组。
示例:
// 以数字集合 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();
这是一个经典的等概率洗牌算法,首先是最基本的模拟思路
class Solution {
private:
vector<int> nums;
vector<int> temp;
public:
Solution(vector<int> nums) {
this->nums = nums;
this->temp = nums;
}
/** 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;
//srand((int)time(NULL));
while(temp.size()){
// 每次洗排操作从n个元素中随机挑一个元素加入到结果数组中
// 下一步删除这个元素,从下面n-1个元素中随机挑选一个元素加入到结果数组中
int i = rand()%temp.size();
res.push_back(temp[i]);
temp.erase(temp.begin()+i);
}
// 因为可能连续调用shuffle函数,所以最后要将temp还原
temp = nums;
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();
*/
经典的洗牌算法,首先从i从[0,N),每次随机取[i,N-i)的下标的数,与第i个元素交换
class Solution {
private:
vector<int> Elements;
public:
Solution(vector<int> nums) {
Elements = nums;
}
/** Resets the array to its original configuration and return it. */
vector<int> reset() {
return Elements;
}
/** Returns a random shuffling of the array. */
vector<int> shuffle() {
vector<int> vShuffle = Elements;
//srand(time(NULL));
for(int i=0;i<vShuffle.size();i++){
int r = rand()%(vShuffle.size()-i)+i;
if(r!=i)
swap(vShuffle[r], vShuffle[i]);
}
return vShuffle;
}
};
/**
* 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();
*/