【LeetCode】189. 轮转数组 - 双指针

189. 轮转数组

2023-8-9 18:10:34

class Solution {
    public void rotate(int[] nums, int k) {
        int last = nums.length - 1;
        reverse(0, last, nums);
        reverse(0, k % nums.length - 1, nums);
        reverse(k % nums.length, last, nums);
    }

    private void reverse(int pre, int last, int[] nums) {
        while (pre < last) {
            int x = nums[pre];
            nums[pre] = nums[last];
            nums[last] = x;
            pre++;
            last--;
        }
    }
}