Majority Element

最新推荐文章于 2025-06-09 20:08:01 发布

原创最新推荐文章于 2025-06-09 20:08:01 发布 · 290 阅读

0 ·

CC 4.0 BY-SA版权

Leetcode 专栏收录该内容

132 篇文章

订阅专栏

本文介绍了一种算法，用于在给定数组中找到出现次数超过数组长度一半的元素。通过迭代数组并使用计数变量，算法能够高效地识别出这种特定类型的元素。

摘要生成于 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.

if extend the problem to more than⌊ n/k ⌋ times, need a k-1 size array.

class Solution {
public:
    int majorityElement(vector<int> &num)
	{
	    if (num.empty())
	    	return 0;
        int repeat = 1;
        int cur = num[0];
        
        for (int i = 1; i < num.size(); i++)
        {
        	if (cur == num[i])
        		repeat++;
        	else if (--repeat == 0)
        	{
        		cur = num[i];
        		repeat = 1;
        	}
        }
        return cur;
    }
};