https://leetcode.com/problems/shuffle-an-array/
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();
这题做的真的让人觉得很愚蠢,唯一的意义或许就是随机shuffle这个实现,有两种方式:
两者都是从前往后逐渐确定,但是一种是从已确定部分选择交换的对象,另一种是从尾部的未确定部分选择对象。针对后者,等概率的性质很显然,针对前者,使用数学归纳法,参考:
每次往后读取数组的时候,当读到第i个的时候以1/i的概率随机替换1~i中的任何一个数,这样保证最后每个数字出现在每个位置上的概率都是相等的。
证明:
设x元素在第m次的时候出现在位置i的概率是1/m,那么在第m+1次的时候,x仍然待在位置i的概率是 1/m * m/(m+1) = 1/(m+1)
class Solution {
public:
vector<int> ori;
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> result(ori);
int tar;
for(int i = 1; i < result.size(); ++i){
tar = rand()%(i+1);
swap(result[i], result[tar]);
}
return result;
}
};
/**
* 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();
*/