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

方法1:

JK: https://yjk94.wordpress.com/2017/03/17/洗牌的正确姿势-knuth-shuffle算法/

思路：

参见上面的博客。依次遍历，每个位置上的数都只能和它之前位置上的任意一个随机数交换位置，包括它自己（此时不发生交换）。

易错点

1. python里面的语法很简单，c++里需防止发生division by zero。

Complexity

Time complexity : O(n)
Space complexity: O(n)

class Solution {
public:
    Solution(vector<int> nums)  {
        copy = nums;
    }
    
    /** Resets the array to its original configuration and return it. */
    vector<int> reset() {
        return copy;
    }
    
    /** Returns a random shuffling of the array. */
    vector<int> shuffle() {
        vector<int> result(copy.begin(), copy.end());
        for (int i = 0; i < result.size(); i ++){
            int t = rand() % (i + 1);
            swap(result[t], result[i]);
        }
        return result;
    }
private: 
    vector<int> copy;
};

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