n数k移动
代码:
import java.util.Scanner;
public class fiftynine {
public static void main(String[] args) {
Scanner reader=new Scanner(System.in);
int n=reader.nextInt();
int k=reader.nextInt();
int[] a=new int[n];
int[] b=new int[n];
for(int i=0;i<n;i++) {
a[i]=reader.nextInt();
}
for(int i=0;i<n;i++) {
b[i]=a[(i+k-1)%n];
System.out.printf("%d ",b[i]);
}
}
}
运行结果: