LeetCode 0169 - Majority Element

Reck Zhang

发布于 2021-08-11 14:51:29

1830

发布于 2021-08-11 14:51:29

文章被收录于专栏：Reck Zhang

Majority Element

Desicription

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

Solution

class Solution {
public:
    int majorityElement(vector<int>& nums) {
        int num = 0;
        int cnt = 0;
        for(auto it : nums) {
            if(num != it) {
                cnt--;
                if(cnt < 0)
                    num = it, cnt = 0;
            }
            else
                cnt++;
        }
        return num;
    }
};

本文参与腾讯云自媒体同步曝光计划，分享自作者个人站点/博客。

原始发表：2018-06-04，如有侵权请联系 cloudcommunity@tencent.com 删除

element