c_cpp 189.旋转阵列 - 难度容易 - 2018.9.4

Posted 2021-05-14

class Solution {
public:
    void swap(vector<int>&nums, int left, int right) {
        if (left >= right || nums.size() <= 0 || left < 0 || right >= nums.size()) {
            return;
        }
        int tmp;
        while (left < right) {
            tmp = nums[right];
            nums[right] = nums[left];
            nums[left] = tmp;
            left++; right--;
        }
    }
    void rotate(vector<int>& nums, int k) {
        k = k % nums.size();
        swap(nums, 0, nums.size()-k-1);
        swap(nums, nums.size()-k, nums.size()-1);
        swap(nums, 0, nums.size()-1);
    }
};