打乱一个没有重复元素的数组。
示例:
// 以数字集合 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();
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/shuffle-an-array
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
class Solution {
private:
vector<int> shuffle_array,copy_array;
public:
Solution(vector<int>& nums)
:copy_array(nums),shuffle_array(nums){}
/** Resets the array to its original configuration and return it. */
vector<int> reset() {
//空间复杂度O(n)
return copy_array;
}
/** Returns a random shuffling of the array. */
vector<int> shuffle() {
//每次随机取出一张牌,然后和最后一张牌交换即可
//时间复杂得O(n)
int n = shuffle_array.size();
int curlength = n;
int index = -1;
for(int i=0;i<n;i++){
index = (double)(rand()%10)/10 * curlength;
//取出牌交换
int temp = shuffle_array[curlength - 1];
shuffle_array[curlength - 1] = shuffle_array[index];
shuffle_array[index] = temp;
curlength--;
}
return shuffle_array;
}
};
/**
* 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();
*/