Java|PAT|1008 数组元素循环右移问题 (20分)|解析

解析答案如下：

import java.util.Scanner;
//思路：想的简单点，把数组循环改成数组输出数字的先后顺序，先输出后几位，再输出前几位！
public class Main {
    
    
    public static void main(String[] args) {
    
    
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int cishu = sc.nextInt();
        int[] arr = new int[n];
        for (int i = 0; i < n; i++) {
    
    
            arr[i] = sc.nextInt();
        }
        reverse(arr, cishu);

    }

    public static void reverse(int[] arr, int cishu) {
    
    
        int a = 0, b = 0;
        a=arr.length;
        //这是一个坑，测试点2和测试点3会输入循环次数大于数组长度的数
        a %=cishu;
        for (int i = 0; i < cishu; i++) {
    
    
            System.out.print(arr[arr.length - cishu + i] + " ");
        }
        for (int i = 0; i < arr.length - cishu; i++) {
    
    
            if (i != arr.length - cishu - 1) {
    
    
                System.out.print(arr[i]+" ");
            } else {
    
    
                System.out.print(arr[arr.length - cishu - 1]);
            }

        }
    }
}