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

• 这就是 std::rotate 的功能，它可以交换两个区间范围内的元素

class Solution {
 public:
  void rotate(vector<int>& nums, int k) {
    std::rotate(nums.rbegin(), nums.rbegin() + k % nums.size(), nums.rend());
  }
};

• 原理是三次翻转

1234 567 => 目标 567 1234
765 4321
567 1234

• 实现如下

class Solution {
 public:
  void rotate(vector<int>& nums, int k) {
    k %= nums.size();
    reverse(nums.begin(), nums.end());
    reverse(nums.begin(), nums.begin() + k);
    reverse(nums.begin() + k, nums.end());
  }
};