数组逆置算法：实现数组的逆序

import java.util.Random;
import java.util.Scanner;

/**
 * @Author: Guojiang
 * @Date: 2022/12/28/15:54
 * @Description:
 */

public class test8_array {
    public static void main(String[] args) {
        int[] array={1,2,3};
//        Random r=new Random();
//        for (int i = 0; i < array.length; i++) {
//            array[i]=r.nextInt(100)+1;
//        }
        int temp;
        /*int max=0x7fffffff;

        Scanner sc=new Scanner(System.in);
        for (int i = 1; i < array.length; i++) {
            if(array[i]<max)
                max=array[i];
        }*/
        for (int i = 0; i < array.length; i++) {
            System.out.print(array[i]+" ");
        }
        System.out.println();
      /* System.out.println("输入的最小的值为"+max);*/
       for (int i = 0; i < array.length/2; i++) {
            temp=array[i];
            array[i]=array[array.length-1-i];
            array[array.length-1-i]=temp;
       }
// 方法二
     /*   for (int i = 0,j=array.length-1; i < j; i++,j--) {
            temp=array[i];
            array[i]=array[j];
            array[j]=temp;
        }*/
        System.out.println("反转后的数组为");
        for (int i = 0; i < array.length; i++) {
            System.out.print(array[i]+" ");
        }
    }
}