62,634
社区成员




//定义一个整型数组,求出数组最大值和最小值 并输出结果
public static void minMax(){
int oldArr[] = {1,3,4,5,6,9,6,6,2,5,4,7,6,7,8,5};
int minNum = 0; //最小值
int maxNum = 0; //最大值
for(int i = 0, j = 1; i < oldArr.length ; i ++ ){
if(oldArr[i] > maxNum){
maxNum = oldArr[i];
}
if(minNum == 0){
if(oldArr[i] < oldArr[j]){
minNum = oldArr[i];
}else{
j++;
}
}
}
System.out.println("最小:"+minNum+"最大:"+maxNum);
}
public static void minMax(int[] array) {
int min = array[0];
int max = array[0];
for (int i = 1; i < array.length; i++) {
if ( array[i] > max) {
max = array[i];
}
else if ( array[i] < min) {
min = array[i];
}
}
System.out.println("min: " + min + " max: " + max);
}
public static void minMax(int[] array) {
int min = array[0];
int max = array[0];
for (int i = 1; i < array.length; i++) {
if ( array[i] > max) {
max = array[i];
}
if ( array[i] < min) {
min = array[i];
}
}
System.out.println("min: " + min + " max: " + max);
}
int minNum = oldArr[0];
int maxNum = oldArr[0];
for (int i = 1; i < oldArr.length; i++) {
if (minNum > oldArr[i]) {
minNum = oldArr[i];
}
if (maxNum > oldArr[i]) {
maxNum = oldArr[i];
}
}