数组整体右移k位问题

import java.util.Arrays;

public class  {
   public static void main(String[] args) {
     int[] nums = new int[] { 1, 2, 3, 4, 5, 6, 7, 8 };
        int k = 2;
      System.out.println(Arrays.toString(nums));

      // 方法一：暴力循环调用右移一次的函数

        for (int i = 0; i < k; i++) {
       youYiOnce(nums);
         }
        System.out.println(Arrays.toString(nums));

     // 方法二：
        
        //将整个长度为N的数组倒置得到b^{-1}a^{-1}
      reverse(nums, 0, nums.length - 1);
        //将b^{-1}数组和a^{-1} 数组分别倒置, 得到 ba数组.
        reverse(nums, 0, k - 1);
     reverse(nums, k, nums.length - 1);
       System.out.println(Arrays.toString(nums));

  }
    //右移一次的函数
   public static void youYiOnce(int[] nums) {
      int last = nums[nums.length - 1];
       for (int i = nums.length - 2; i >= 0; i--) {
            nums[i + 1] = nums[i];
       }
        nums[0] = last;
  }
    
 //转置数组的第start到end位
  public static void reverse(int[] nums, int start, int end) {
      for (int i = start; i <= end; i++) {
            int temp = nums[start];
         nums[start] = nums[end];
         nums[end] = temp;
            start++;
         end--;
       }
    }
}