36 有n个整数,使其前面各数顺序向后移n个位置,最后m个数变成最前面的m个数

题目:有n个整数,使其前面各数顺序向后移n个位置,最后m个数变成最前面的m个数

     public class _036ExchangeSite {

     public static void main(String[] args) {
         exchangeSite();
     }

     private static void exchangeSite() {
         int N = 10;
         int[] a = new int[N];
         Scanner scanner = new Scanner(System.in);

         System.out.println("请输入10个整数 :");
         for (int i = 0; i < N; i++) {
             a[i] = scanner.nextInt();
         }

         System.out.println("你输入的数组为 :");
         for (int i = 0; i < N; i++) {
             System.out.print(a[i] + " ");
         }

         System.out.println("\n请输入向后移动的位数 :");
         int m = scanner.nextInt();
         int[] b = new int[m];
         for (int j = 0; j < m; j++) {
             b[j] = a[N - m + j];
         }

         for (int k = N - 1; k >= m; k--) {
             a[k] = a[k - m];
         }

         for (int l = 0; l < m; l++) {
             a[l] = b[l];
         }

         System.out.println("位移后的数组是 :");
         for (int n = 0; n < N; n++) {
             System.out.print(a[n] + " ");
         }
     }
 }