384. Shuffle an Array

版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/BigFatSheep/article/details/79969036

问题描述

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();

题目链接:


思路分析

给一个数组,每次对数组进行洗牌,返回一个随机的数组,并实现还原功能,返回最初输入的数组。

用两个数组保存输入的nums的值,arr用来进行shuffle洗牌,随机输出,idx保存了最初的数组值。

利用rand()生成随机数,然后映射到数组上,进行随机位置互换,来生成随机数组。

代码

class Solution {
vector arr, idx;
public:
Solution(vector nums) {
srand(time(NULL));
arr.resize(nums.size());
idx.resize(nums.size());
for (int i = 0; i < nums.size(); i++){
arr[i] = nums[i];
idx[i] = nums[i];
}
}

/** Resets the array to its original configuration and return it. */
vector<int> reset() {
    for (int i = 0;i < arr.size(); i++)
        arr[i] = idx[i];
    return arr;    
}

/** Returns a random shuffling of the array. */
vector<int> shuffle() {
     int i,j;
     for (i = arr.size() - 1; i > 0; i--) {
        j = rand() % (i + 1);
        swap(arr[i], arr[j]);
     }
     return arr;    
}

};

/**
* Your Solution object will be instantiated and called as such:
* Solution obj = new Solution(nums);
* vector param_1 = obj.reset();
* vector param_2 = obj.shuffle();
*/
“`
时间复杂度:O(n)
空间复杂度:O(n)


反思

对于rand()的使用,因为是用线性同余的方式生成随机数,所以是一个伪随机,只是周期非常长,在短时间内可以看作是随机的。

阅读更多 登录后自动展开
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页