Rotate Array

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

func rotate(nums []int, k int) {
    n := len(nums)
    k %= n
    rev := func(lo, hi int) {
        for lo < hi {
            nums[lo], nums[hi] = nums[hi], nums[lo]
            lo++
            hi--
        }
    }
    rev(0, n-1)
    rev(0, k-1)
    rev(k, n-1)
}

from typing import List

class Solution:
    def rotate(self, nums: List[int], k: int) -> None:
        n = len(nums)
        k %= n

        def rev(lo: int, hi: int) -> None:
            while lo < hi:
                nums[lo], nums[hi] = nums[hi], nums[lo]
                lo += 1
                hi -= 1

        rev(0, n - 1)
        rev(0, k - 1)
        rev(k, n - 1)

function rotate(nums, k) {
    const n = nums.length;
    k %= n;
    const rev = (lo, hi) => {
        while (lo < hi) {
            [nums[lo], nums[hi]] = [nums[hi], nums[lo]];
            lo++;
            hi--;
        }
    };
    rev(0, n - 1);
    rev(0, k - 1);
    rev(k, n - 1);
}

class Solution {
    private int[] nums;

    public void rotate(int[] nums, int k) {
        this.nums = nums;
        int n = nums.length;
        k %= n;
        rev(0, n - 1);
        rev(0, k - 1);
        rev(k, n - 1);
    }

    private void rev(int lo, int hi) {
        while (lo < hi) {
            int tmp = nums[lo];
            nums[lo++] = nums[hi];
            nums[hi--] = tmp;
        }
    }
}

function rotate(nums: number[], k: number): void {
    const n = nums.length;
    k %= n;
    const rev = (lo: number, hi: number): void => {
        while (lo < hi) {
            [nums[lo], nums[hi]] = [nums[hi], nums[lo]];
            lo++;
            hi--;
        }
    };
    rev(0, n - 1);
    rev(0, k - 1);
    rev(k, n - 1);
}