import java.util.Scanner;
public class SecondMAX {
public static void main(String args[]) {
System.out.println(new SecondMAX().getResult());
}
public int getResult() {
int num, max, sec_max;
Scanner sc = new Scanner(System.in);
System.out.println("请输入你要查找数组的元素个数:");
num = sc.nextInt();
int[] array = new int[num];
for (int i = 0; i < num; i++) {
array[i] = sc.nextInt();
}
max = sec_max = array[0];
for (int i = 1; i < num; i++) {
if (array[i] > max) {
sec_max = max;
max = array[i];
}
}
return sec_max;
}
}
O(n)时间内查找到无序数组当中的第二大元素
最新推荐文章于 2021-06-22 10:23:36 发布