leetcode 747. Largest Number At Least Twice of Others python

在给定的整数数组nums中，总是有一个最大的元素。
查找数组中的最大元素是否至少是数组中每个其他数字的两倍。

如果是，则返回最大元素的索引，否则返回-1。

class Solution(object):
    def dominantIndex(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        if len(nums) == 0:
            return -1
        highest = -1
        secondhighest = -1
        index = 0

        for i, num in enumerate(nums):
            if num >= highest:
                secondhighest = highest
                highest = num
                index = i
            elif num > secondhighest:
                secondhighest = num

        if highest < secondhighest * 2:
            index = -1
       
        return index