Leetcode 169. Majority Element

Tyan

发布于 2019-05-25 22:19:40

25500

代码可运行

文章被收录于专栏：SnailTyanSnailTyan

运行总次数：0

代码可运行

文章作者：Tyan

博客：noahsnail.com | CSDN | 简书

1. Description

2. Solution

Version 1

class Solution {
public:
    int majorityElement(vector<int>& nums) {
        int n = nums.size() / 2;
        unordered_map<int, int> m;
        for(int num : nums) {
            m[num]++;
            if(m[num] > n) {
                return num;
            }
        }
    }
};

Version 2

class Solution {
public:
    int majorityElement(vector<int>& nums) {
        int count = 0;
        int candidate = 0;
        for(int num : nums) {
            if(count == 0) {
                candidate = num;
            }
            count += (candidate==num?1:-1); 
        }
        return candidate;
    }
};