[LeetCode] Majority Element

最新推荐文章于 2019-02-22 16:24:01 发布

原创最新推荐文章于 2019-02-22 16:24:01 发布 · 317 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode 专栏收录该内容

131 篇文章

订阅专栏

本文介绍了一种高效的方法来查找给定数组中出现次数超过一半的元素，利用了投票算法的思想，通过迭代数组并更新候选元素及其计数，最终确定多数元素。

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.

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