Leetcode - 169. Majority Element (多数投票问题)

最新推荐文章于 2021-11-01 22:15:17 发布

原创最新推荐文章于 2021-11-01 22:15:17 发布 · 129 阅读

0 ·

CC 4.0 BY-SA版权

秋招专栏收录该内容

179 篇文章

订阅专栏

本文介绍了一种高效查找数组中多数元素的算法。多数元素是指在数组中出现次数超过数组长度一半的元素。文章通过示例展示了算法的具体实现，如输入[3,2,3]，输出3；输入[2,2,1,1,1,2,2]，输出2。该算法适用于非空数组，且假设数组中始终存在多数元素。

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

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.

Example 1:

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

Example 2:

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

def majorityElement(nums):

    candidate = None
    count = 0

    for item in nums:

        if item == candidate:
            count+=1

        elif count > 0:
            count -= 1

        else:
            candidate,count = num,1

    return candidate