384. Shuffle an Array(unsolved)

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

解答：
这道题也是随机的，不同之处在于我们知道了总长度，所以可以对于遍历的每个位置都对总长度以内产生一个数，然后用这个位置和以该数为下标的数交换。

其实与水塘排序法每太大关系了那就。

class Solution {
public:
    Solution(vector<int> nums):v(nums) {
    }

    /** Resets the array to its original configuration and return it. */
    vector<int> reset() {
        return v;
    }

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

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