题解 | #数组遍历#

import java.util.Scanner;

public class Main { public static void main(String[] args) { int[] ary = new int[6]; int max; int min; Scanner scanner = new Scanner(System.in); for (int i = 0; i <ary.length ; i++) { ary[i]=scanner.nextInt(); }

    //write your code here......
    //用冒泡排序
   /* 
   int temp = 0;
    for(int i = 0;i < ary.length ; i++){
        for(int j = i + 1;j < ary.length ; j++){
            if(ary[i] < ary[j]){
                temp = ary[i];
                ary[i] = ary[j];
                ary[j] = temp;
            }
        }
    }
    max = ary[0];
    min = ary[ary.length-1];
    */
    max = ary[0];
    min = ary[0];
    for(int i = 1;i < ary.length; i++){
        if(ary[i] > max){
            max = ary[i];
        }
        if(ary[i] < min){
            min = ary[i];
        }
    }
    System.out.println(max+" "+min);
}

}