0
点赞
收藏
分享

微信扫一扫

C++ | Leetcode C++题解之第189题轮转数组

一天清晨 2024-06-26 阅读 30

题目:

题解:

class Solution {
public:
    void reverse(vector<int>& nums, int start, int end) {
        while (start < end) {
            swap(nums[start], nums[end]);
            start += 1;
            end -= 1;
        }
    }

    void rotate(vector<int>& nums, int k) {
        k %= nums.size();
        reverse(nums, 0, nums.size() - 1);
        reverse(nums, 0, k - 1);
        reverse(nums, k, nums.size() - 1);
    }
};
举报

相关推荐

0 条评论