题解 | #数组遍历#
数组遍历
http://www.nowcoder.com/practice/0f8219cb6f6e4e99a1bb0e868e51d60a
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......
max=ary[0];
min=ary[0];
for(int i=1;i<ary.length;i++)
{
max=max>ary[i]?max:ary[i];//遍历数组找最大值
min=min<ary[i]?min:ary[i];
}
System.out.println(max+" "+min);
}
}