【LeetCode】747. Largest Number At Least Twice of Others

版权声明：本文为博主原创文章，请尊重原创，转载请注明原文地址和作者信息！ https://blog.csdn.net/zzc15806/article/details/82417739

class Solution:
    def dominantIndex(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        if len(nums) == 1:
            return 0
        max_elem = max(nums)
        max_index = nums.index(max_elem)
        nums.remove(max_elem)
        if max(nums) <= max_elem/2:
            return max_index
        else:
            return -1


class Solution:
    # 遍历数组，找出最大值和次大值
    def dominantIndex(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        largeOne, largeTwo = 0, 0
        for i in range(len(nums)):
            if nums[i] > largeTwo:
                largeOne, largeTwo = max(nums[i], largeOne), min(nums[i], largeOne)
        if largeTwo <= largeOne/2:
            return nums.index(largeOne)
        else:
            return -1