Lintcode 47. Majority Element II (Medium) (Python)

最新推荐文章于 2020-09-17 21:28:58 发布

原创最新推荐文章于 2020-09-17 21:28:58 发布 · 232 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#Lintcode #Python

Lintcode刷题专栏收录该内容

82 篇文章

订阅专栏

本文介绍了一种寻找数组中出现次数超过1/3的多数元素的方法。该算法能够在O(n)的时间复杂度和O(1)的空间复杂度下找到多数元素。通过实例演示了如何使用这种方法解决问题。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Majority Element II

Description:

Given an array of integers, the majority number is the number that occurs more than 1/3 of the size of the array.

Find it.

Example
Given [1, 2, 1, 2, 1, 3, 3], return 1.

Challenge
O(n) time and O(1) extra space.

Notice
There is only one majority number in the array.

Code:

class Solution:
    """
    @param: nums: a list of integers
    @return: The majority number that occurs more than 1/3
    """
    def majorityNumber(self, nums):
        # write your code here
        if nums == None:
            return []
        cnt1, cnt2, tmp1, tmp2 = 0, 0, 0, 0
        for i in range(len(nums)):
            if nums[i] == tmp1:
                cnt1 += 1
            elif nums[i] == tmp2:
                cnt2 += 1
            elif cnt1 == 0:
                cnt1 = 1
                tmp1 = nums[i]
            elif cnt2 == 0:
                cnt2 = 1
                tmp2 = nums[i]
            else:
                cnt1-=1
                cnt2-=1
        if nums.count(tmp1) >(1/3)*len(nums):
            return tmp1
        else:
            return tmp2