LeetCode-Solutions-in-Cpp17

Solutions to high-frequency interview questions of LeetCode in C++17, taking into account both efficiency and comprehensibility.

---

Project maintained by downdemo Hosted on GitHub Pages — Theme by mattgraham

• 每次从右侧取一个元素放到最左边，这样每个元素被放到指定位置的概率都相同

class Solution {
 public:
  Solution(vector<int>& nums) { v.assign(begin(nums), end(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> res{v};
    for (int i = 0; i < size(res); ++i) {
      int t = i + rand() % (size(res) - i);
      swap(res[i], res[t]);
    }
    return res;
  }

 private:
  vector<int> v;
};