题解 | #数组遍历#
数组遍历
https://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();
}
max = ary[0];
for(int i = 1; i <ary.length ;i++){
if(ary[i]>max){
max = ary[i];
}
}
min = ary[0];
for(int j = 1; j <ary.length ;j++){
if(ary[j]<min){
min = ary[j];
}
}
System.out.println(max+" "+min);
}
}
汤臣倍健公司氛围 361人发布

查看15道真题和解析