题解 | #数组倒转#

第一个元素与最后一个元素交换，第二个元素与倒数第二个交换，依次进行到中间结束。

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......
        int len = arr.length;
        for (int i = 0; i < len / 2; i++) {
            swap(arr, len, i);
        }
        System.out.println(Arrays.toString(arr));
    }
     private static void swap(int[] arr, int len, int i) {
        int temp = arr[i];
        arr[i] = arr[len - 1 - i];
        arr[len - 1 - i] = temp;
    }
}