打乱一个没有重复元素的数组。
示例:
// 以数字集合 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 {
public:
vector<int> ret;
vector<int> pre;
unsigned seed;
Solution(vector<int>& nums)
{
seed = std::chrono::system_clock::now().time_since_epoch().count();
ret = pre = nums;
}
/** Resets the array to its original configuration and return it. */
vector<int> reset()
{
//ret = pre;
return pre;
}
/** Returns a random shuffling of the array. */
vector<int> shuffle()
{
seed = std::chrono::system_clock::now().time_since_epoch().count();
std::shuffle(ret.begin(), ret.end(), std::default_random_engine(seed));
return ret;
}
};
/**
* 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();
*/