【leetcode】384. Shuffle an Array

题目：
Shuffle a set of numbers without duplicates.

---

思路：
vector<int> &nums用来保存原数组。
reset函数： 直接返回原数组。
shuffle函数： 当前元素为nums[j]，在此之前的元素中随机抽一个元素——nums[i]（可能i==j），然后swap这两个数。

---

代码实现：

class Solution {
public:
    
    Solution(vector<int>& nums): nums(nums){
        
    }
    
    /** Resets the array to its original configuration and return it. */
    vector<int> reset() {
        return nums;
    }
    
    /** Returns a random shuffling of the array. */
    vector<int> shuffle() {
        vector<int> ret(nums);
        
        for (int j = 1; j < ret.size(); ++j){
            int i = RandomInRange(0, j);
            swap(ret[i], ret[j]);
        }
        
        return ret;
    }
    
    int RandomInRange(int start, int end) { // 随机数[start, end]
        return rand() % (end - start + 1) + start;
    }
    
private:
    vector<int> &nums;
};

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

---

参考：
https://leetcode.com/problems/shuffle-an-array/discuss/85958/First-Accepted-Solution-Java