229. Majority Element II 【M】【52】

最新推荐文章于 2021-12-09 08:39:45 发布

sscssz

最新推荐文章于 2021-12-09 08:39:45 发布

阅读量319

点赞数

分类专栏： leetcode 算法 Python 字符串文章标签： leetcode leetcode题解 python string

本文链接：https://blog.csdn.net/sscssz/article/details/51417277

版权

Python 同时被 3 个专栏收录

176 篇文章 0 订阅

订阅专栏

leetcode

175 篇文章 0 订阅

订阅专栏

算法

157 篇文章 0 订阅

订阅专栏

Given an integer array of size n, find all elements that appear more than ⌊ n/3 ⌋ times. The algorithm should run in linear time and in O(1) space.

Hint:

How many majority elements could it possibly have?
Do you have a better hint? Suggest it!

Subscribe to see which companies asked this question

还是用抵消的办法

开始的参数是0.5，通过了

后来改成1 ，也通过了……

class Solution(object):
    def majorityElement(self, nums):
        a = '' #nums[0]
        b = '' #nums[1]
        
        ta = 0
        tb = 0
        
        l = len(nums)
        if l == 2:
            return list(set(nums))
        
        times = l/3
        
        for i in nums[:]:
            if i == a:
                ta += 1
            elif i == b:
                tb += 1
            elif ta <= 0:
                a = i
                ta = 1
            elif tb <= 0:
                b = i
                tb = 1
            else:
                ta -= 1
                tb -= 1
            
        res = []
        if nums.count(a) > times:
            res += a,
        if a != b and nums.count(b) > times:
            res += b,
        return res