class Solution:
def dominantIndex(self, nums: List[int]) -> int:
lens = len(nums)
if lens == 0:
return -1
if lens == 1:
return 0
nums_position = range(lens)
#对下标进行排序,对排序后的结果比较最大和次大即可
nums_position = sorted(nums_position, key=lambda i: nums[i], reverse=True)
try:
if nums[nums_position[0]] / nums[nums_position[1]] >= 2:
return nums_position[0]
else:
return -1
except ZeroDivisionError:
return nums_position[0]