LeetCode 229: Majority Element II

最新推荐文章于 2021-02-06 19:45:44 发布

forever_zzx

最新推荐文章于 2021-02-06 19:45:44 发布

阅读量120

点赞数

分类专栏： python 算法文章标签： LeetCode

本文链接：https://blog.csdn.net/forever_zzx/article/details/88047340

版权

算法同时被 2 个专栏收录

48 篇文章 0 订阅

订阅专栏

python

46 篇文章 0 订阅

订阅专栏

Given an integer array of size n, find all elements that appear more than ⌊ n/3 ⌋ times.

Note: The algorithm should run in linear time and in O(1) space.

Example 1:

Input: [3,2,3]
Output: [3]

Example 2:

Input: [1,1,1,3,3,2,2,2]
Output: [1,2]

Save two different element, if one is not equal to either, the num of the two elments should decrease by 1. When traval finish, the check the num of the two.

class Solution(object):
    def majorityElement(self, nums):
        a, b = 0, 0
        c1, c2 = 0, 0
        for num in nums:
            if num == a:
                c1 += 1
            elif num == b:
                c2 += 1
            elif c1 != 0 and c2 != 0:
                c1 -= 1
                c2 -= 1
            elif c1 == 0:
                a = num
                c1 = 1
            else:
                b = num
                c2 = 1
        c1, c2 = 0, 0
        for num in nums:
            if num == a:
                c1 += 1
            elif num == b:
                c2 += 1
        res = []
        if c1 > len(nums)//3:
            res.append(a)
        if c2 > len(nums)//3:
            res.append(b)
        return res