import java.util.Scanner; public class Tenth { /*有n個整數,使其前面各數順序向後移m個位置,最後m個數變成最前面的m個數*/ public static void main(String[] args){ Scanner input=new Scanner(System.in); System.out.println("您將輸入的數字個數為:"); int a=input.nextInt(); int[] array=new int[a]; int t,i; System.out.println("您要交換的數字個數為:"); int b=input.nextInt(); System.out.println("請輸入數組:"); for(i=0;i<a;i++) array[i]=input.nextInt(); System.out.println("交換之前數組為:"); for(i=0;i<a;i++) System.out.print(array[i]+" "); for(i=0;i<b;i++){ t=array[i]; array[i]=array[array.length-b+i]; array[array.length-b+i]=t; } System.out.println("\n"+"交換之後數組為:"); for(i=0;i<a;i++) System.out.print(array[i]+" "); } }