JAVA经典算法(三十六)

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

package cn.ls.lanqiao;

import java.util.Scanner;

public class Test36 {
	public static void main(String[] args) {

		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		int[] a = new int[N];
		for (int i = 0; i < N; i++) {
			a[i] = sc.nextInt();
		}
		System.out.print("请输入向后移动的位数：");
		int m = sc.nextInt();
		int[] b = new int[m];
		for (int i = 0; i < m; i++) {
			b[i] = a[N - m + i];
		}
		for (int i = N - 1; i >= m; i--) {
			a[i] = a[i - m];
		}
		for (int i = 0; i < m; i++) {
			a[i] = b[i];
		}

		for (int i = 0; i < N; i++) {
			System.out.print(a[i] + " ");
		}
	}
}