leetcode求众数

1. 哈希法

class Solution:
    def majorityElement(self, nums: List[int]) -> int:
        # 时间复杂度o(n)
        # 空间复杂度O(n)

        dict_num = {}
        for item in nums:
            if item in dict_num:
                dict_num[item] +=1
            else:
                dict_num[item] = 1

            if dict_num[item] > len(nums) // 2:
                return item

        return -1

2. 摩尔投票法，两个不同的数相互抵消，剩下的区间中众数仍然是众数

class Solution:
    def majorityElement(self, nums: List[int]) -> int:
        # 时间复杂度o(n)
        # 空间复杂度O(1)

        n = len(nums)
        if n <= 0:
            return

        res = 0
        count = 0
        for i in range(n):
            if count == 0:
                res = nums[i]
                count = 1
            elif nums[i] == res:
                count += 1
            else:
                count -=1
        return res

1. 哈希表，直接统计频次，返回个数大于1/3的，时间复杂度O(n)，空间复杂度O(n)

class Solution:
    def majorityElement(self, nums: List[int]) -> List[int]:
        # 和递归回溯有啥关系呢
        
        n = len(nums)
        if n <= 0:
            return 
        
        dict_num = {}
        res = set()
        for item in nums:
            if item in dict_num:
                dict_num[item] +=1
            else:
                dict_num[item] = 1
            
            if dict_num[item] > n // 3:
                res.add(item)
        return list(res)

2. 摩尔投票法，使用三个不同元素抵消的策略

class Solution:
    def majorityElement(self, nums: List[int]) -> List[int]:
        # 个数大于1/2，最多只可能有一个
        # 个数大于1/3，最多只可能有两个
        # 时间复杂度O(n)，空间复杂度O(1)

        if len(nums) == 0:
            return nums
        
       if len(nums) <= 0:
            return nums

        num1 = 0
        num2 = 0
        count1 = 0
        count2 = 0

        for item in nums:
            if num1 == item:
                count1 += 1
            elif num2 == item:
                count2 += 1
            elif count1 == 0:
                num1 = item
                count1 = 1
            elif count2 == 0:
                num2 = item
                count2 = 1
            else:
                count1 -= 1
                count2 -= 1
        # 验证阶段,返回结果
        res = set()
        count1 = 0
        count2 = 0
        for item in nums:
            if num1 == item:
                count1 += 1
            elif num2 == item:
                count2 += 1

        if count1 > len(nums) // 3: res.add(num1)
        if count2 > len(nums) // 3: res.add(num2)

        return list(res)