题解 | 数组倒转

import java.util.Arrays;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        int[] arr = new int[6];
        Scanner scanner = new Scanner(System.in);
        for (int i = 0; i < arr.length; i++) {
            arr[i] = scanner.nextInt();
        }
        System.out.println(Arrays.toString(arr));

        //write your code here......
        //用temp作为中间变量进行互换，注意i<j,偶数正好最后一组是i+1=j,如果是奇数
        //i+1之后等于j-1,不满足条件i<j，正好是中间卡了一个数，所以奇数最后一次排序是i+2=j
        for(int i=0,j=arr.length-1;i<j;i++,j--){
            int temp =0;
            temp = arr[i];
            arr[i] = arr[j];
            arr[j] = temp;

        }

        System.out.println(Arrays.toString(arr));
    }
}