题目:
代码:
class Solution {
public int dominantIndex(int[] nums) {
if (nums.length < 2) {
return 0;
}
int max = -1;
int maxIndex = -1;
//记录第二大数
int second = -1;
for (int i = 0; i < nums.length; i++) {
if (nums[i] > max) {
second = max;
max = nums[i];
maxIndex = i;
} else if (nums[i] > second) {
second = nums[i];
}
}
//最大数大于等于第二大数的二倍则大于其它所有数的二倍
if (max >= 2 * second) {
return maxIndex;
}
return -1;
}
}