[LeetCode] Majority Element

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;
    }
};