Java数组中取出最大值和最小值、冒泡排序-蒲公英云

Java数组中取出最大值和最小值、冒泡排序

第一种取出最大值和最小值的方法：

package com.yuxuange.maxandmin;
import java.util.Arrays;
import java.util.Scanner;
public class Maxandmin {
    public static void main(String[] args) {
        int[] arr = new int[10];
        Scanner scanner = new Scanner(System.in);
        System.out.println("请输入10个数字......");
        for (int i = 0; i < 10; i++) {
            System.out.println("请输入第" + (i + 1) + "个数字");
            int x = scanner.nextInt();
            arr[i] = x;
        }
        scanner.close();
        for (int j = 0; j < arr.length; j++) {
            System.out.print(arr[j] + " ");
        }
        Arrays.sort(arr);
        System.out.println("\n当前数组中的最小值为" + arr[0] + ",最大值为" + arr[9]);
    }
}

第二种取出最大值和最小值的方法：

package com.yuxuange.maxandmin;
import java.util.Scanner;
public class Maxandmin2 {
    public static void main(String[] args) {
        int[] arr = new int[10];
        Scanner scanner = new Scanner(System.in);
        System.out.println("请输入10个数字......");
        for (int i = 0; i < 10; i++) {
            System.out.println("请输入第" + (i + 1) + "个数字");
            int x = scanner.nextInt();
            arr[i] = x;
        }
        scanner.close();
        for (int j = 0; j < arr.length; j++) {
            System.out.print(arr[j] + " ");
        }
        int max = arr[0];
        int min = arr[0];
        for (int k = 0; k < arr.length - 1; k++) {
            if (max < arr[k]) {
                max = arr[k];
            }
            if (min > arr[k]) {
                min = arr[k];
            }
        }
        System.out.println("\n当前数组中的最小值为" + min + ",最大值为" + max);
    }
}

冒泡排序：

package com.yuxuange.maxandmin;
import java.util.Scanner;
public class Maopao {
    public static void main(String[] args) {
        int[] arr = new int[10];
        Scanner scanner = new Scanner(System.in);
        System.out.println("请输入10个数字......");
        for (int i = 0; i < 10; i++) {
            System.out.println("请输入第" + (i + 1) + "个数字");
            int x = scanner.nextInt();
            arr[i] = x;
        }
        scanner.close();
        for(int j=0;j<arr.length-1;j++) {
            for(int k=0;k<arr.length-1-j;k++) {
                if(arr[k]>arr[k+1]) {
                    int temp=arr[k];
                    arr[k]=arr[k+1];
                    arr[k+1]=temp;
                }
            }
        }
        System.out.println("冒泡排序后的数组为：");
        for (int z : arr) {
            System.out.print(z+" ");
        }
    }
}