[Leetcode] 189. Rotate Array

link: https://leetcode.com/problems/rotate-array/solution/

Solution: using reverse

class Solution {
    public void rotate(int[] nums, int k) {
        int len = nums.length;
        k = k % len;
        if(k == 0) return nums;
        int l = len-k, r = len - 1;
        while(l <= r) {
            swap(nums, l, r);
            l++;
            r--;
        }
        r = len - k - 1;
        l = 0;
        while(l <= r) {
            swap(nums, l, r);
            l++;
            r--;
        }
        l = 0;
        r = len-1;
         while(l <= r) {
            swap(nums, l, r);
            l++;
            r--;
        }
    }
    
    public void swap(int[] sums, int i, int j) {
        int temp = sums[i];
        sums[i] = sums[j];
        sums[j] = temp;
    }
}