数组中元素的互换、反向遍历，求数组中的最大最小值，数组的删除

Remix_xy

已于 2022-02-15 15:05:57 修改

阅读量250

点赞数

文章标签：数组 java idea

于 2022-01-25 14:48:20 首次发布

本文链接：https://blog.csdn.net/Remix_xy/article/details/122684995

版权


       //反转数组中的元素，首尾元素互换
        int [] arr = {10,20,30,40,50,60,70,80};
        for (int i : arr) {
            System.out.print(i+" ");
        }
        for (int i = 0; i < arr.length/2; i++) {
            int t = arr[i];
            arr[i] = arr[arr.length - 1- i];
            arr[arr.length - 1 -i] = t;
        }
        System.out.println();
        for (int i : arr) {
            System.out.print(i+" ");
        }

2、下图：数组的反向遍历


    //数组的反向遍历
        int []arr = {10,20,30,40,50};
        for (int i : arr) {
            System.out.print(i+" ");
        }
        System.out.println();
        //数组的 反向遍历
        for (int i = arr.length - 1; i >= 0 ; i--) {
            System.out.print(arr[i]+" ");
        }

3、求数组中的最大最小值

 int[] arr = {12,34,43,23,56,77,98};
        int max = arr[0], min = arr [0];
        for (int i = 1; i < arr.length; i++) {
            if(arr[i]>max){
                max=arr[i];
                if(arr[i]<min){
                    min = arr[i];
                }
            }
        }
        System.out.println("数组中最大的值是"+max);
        System.out.println("数组中最小的值是"+min);

数组的删除：

//数组的删除
        int arr1[]= {10,59,23,45,543,212,5654,7,4455,43,2,54,87}; 
        System.out.println("删除前："+Arrays.toString(arr1));
        int index=4;
        for (int i = index; i < arr1.length-1; i++) {
            arr1[i] = arr1[i+1];
        }
        arr1[arr1.length-1] = 0;
        System.out.println("删除后："+Arrays.toString(arr1));