题解 | #数组遍历#

import java.util.Scanner;

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

        //write your code here......
       //遍历数组 
          //假设牵引0是最大,和最小
               max=ary[0];
               min=ary[0];
    for (int i = 0; i <ary.length ; i++) {
            
               if(max<=ary[i]){
            max=ary[i];
               }
               if(min>=ary[i]){
                min=ary[i];
               }
            }
        System.out.println(max+" "+min);
    }
}