
import java.util.Scanner;
public class Frist03 {
public static void main(String[] args) {
int index=0;
int[] a=new int[10];
while (index!=a.length) {
Scanner sc = new Scanner(System.in);
System.out.print("输入第" + (index + 1) + ":");
try {
a[index]=sc.nextInt();
index++;
}catch(Exception e) {
System.out.println("你的输入有误,重新输入");
}
}
int max = a[0];
int min = a[0];
for (int i = 0; i < a.length; i++) {
if(a[i]>max) {
max=a[i];
}
if(a[i]
欢迎分享,转载请注明来源:内存溢出
微信扫一扫
支付宝扫一扫
评论列表(0条)