1
class Solution {
2
  public void rotate(int[] nums, int k) {
3
    reverse(nums, 0, nums.length - 1);
4
    reverse(nums, 0, k - 1);
5
    reverse(nums, k, nums.length - 1);
6
  }
7

8
  public static void reverse(int[] arr, int start, int end) {
9
    while (start < end) {
10
      int temp = arr[start];
11
      arr[start] = arr[end];
12
      arr[end] = temp;
13
      start++;
14
      end--;
15
    }
16
  }
17
}