Leetcode: Majority Element

最新推荐文章于 2017-09-17 00:23:15 发布

ayst123

最新推荐文章于 2017-09-17 00:23:15 发布

阅读量221

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode

本文链接：https://blog.youkuaiyun.com/ayst123/article/details/48020157

leetcode 专栏收录该内容

216 篇文章

订阅专栏

本文介绍了一种使用摩尔投票算法解决寻找多数元素问题的方法。该算法仅需遍历一次数组即可找出出现次数超过一半的元素，时间复杂度为O(n)。

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

Question

Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times.

You may assume that the array is non-empty and the majority element always exist in the array.

Credits:
Special thanks to @ts for adding this problem and creating all test cases.

Show Tags
Show Similar Problems

Solution

Analysis

refer to here
Moore voting algorithm.
We maintain a current candidate and a counter initialized to 0. As we iterate the array, we look at the current element x:
1. If the counter is 0, we set the current candidate to x and the counter to 1.
2. If the counter is not 0, we increment or decrement the counter based on whether x is the current candidate.

After one pass, the current candidate is the majority element. Runtime complexity = O(n).

Code

class Solution(object):
    def majorityElement(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """

        most, count = nums[0], 1
        for ind in range(1,len(nums)):
            if nums[ind]==most:
                count += 1
            else:
                if count==0:
                    most = nums[ind]
                else:
                    count -= 1

        return most