leetcode:Majority Element

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

原创最新推荐文章于 2017-09-17 00:23:15 发布 · 766 阅读

0 ·

CC 4.0 BY-SA版权

算法同时被 3 个专栏收录

537 篇文章

订阅专栏

C++/C

504 篇文章

订阅专栏

leetcode

230 篇文章

订阅专栏

本文介绍了一种寻找数组中多数元素的高效算法。多数元素是指在数组中出现次数超过一半的元素。文中提供了一个C++实现的例子，通过遍历数组并使用计数方式找到多数元素。

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

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

class Solution {
public:
    int majorityElement(vector<int> &num) {
        
        // 3 4 5 3 6 3 3
        // 3 3 3 3 4 5 6
        
        int pivot = num[0];
        int count = 1;
        for (int i=1; i< num.size(); i++)
        {
            if (num.at(i) == pivot)
            {
                count++;
            }
            else
            {
                count--;
                if (count == 0)
                {
                    pivot = num.at(i);
                    count = 1;
                }
            }
        }
        
        return pivot;
    }
};