求最大值最小值&数组反转

最新推荐文章于 2024-06-13 08:37:22 发布

十三幺Shisanyao

最新推荐文章于 2024-06-13 08:37:22 发布

阅读量130

点赞数 1

分类专栏： java 算法文章标签： java 算法

本文链接：https://blog.csdn.net/qq_43687583/article/details/126012407

版权

java 同时被 2 个专栏收录

25 篇文章 0 订阅

订阅专栏

算法

24 篇文章 0 订阅

订阅专栏

求最大值最小值


public class ArrayTest6 {

    public static void main(String[] args) {

        int[] arr = new int[10];
        int max = 0;
        int min = 0;
        for (int i = 0; i < arr.length; i++) {

            arr[i] = (int) (Math.random() * 30);

            System.out.println(arr[i]+" ");

        }
        int index1 = -1;
        int index2 = -1;
        for (int i = 0; i < arr.length; i++) {

            max = arr[0];
            if (arr[i] > max) {

                max = arr[i];

                    index1 = i;


            }


        }
        for (int i = 0; i < arr.length; i++) {

            min = arr[0];
            if (arr[i] < min) {
                min = arr[i];


                    index2 = i;

            }



        }

        System.out.println(max);
        System.out.println(min);
        System.out.println(index1);
        System.out.println(index2);

    }


}

数组反转

public class ArrayTest8 {

    public static void main(String[] args) {
        int[] arr = new int[10];


        for (int i = 0; i < arr.length; i++) {

            arr[i] = (int) (Math.random() * 30);

            System.out.print(arr[i]+" ");

        }

        System.out.println();
        int tmp = 0;

        for (int i = 0; i < (arr.length-1)/2; i++) {

            tmp = arr[i];
            arr[i] = arr[arr.length-1-i];
            arr[arr.length-i-1] = tmp;

        }

        for (int i : arr){

            System.out.print(i+" ");

        }


    }


}