java:
简单题重拳出击 遍历遍历 谢谢题解 我啥都做不完 无语了
class Solution {
public int dominantIndex(int[] nums) {
int index = -1;
int n = nums.length;
int cur1 = -1, cur2 = -1;
for(int i = 0; i < n; i++){
if(nums[i] > cur1){
cur2 = cur1;
cur1 = nums[i];
index = i;
}else if(nums[i] > cur2){
cur2 = nums[i];
}
}
if(cur1 >= cur2 * 2){
return index;
}else{
return -1;
}
}
}
python3:
class Solution:
def dominantIndex(self, nums: List[int]) -> int:
n = len(nums)
index, cur1, cur2 = -1, -1, -1
for i in range(n):
if nums[i] > cur1:
cur2 = cur1
cur1 = nums[i]
index = i
elif nums[i] > cur2:
cur2 = nums[i]
if cur1 >= cur2 * 2:
return index
else:
return -1