[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.

解题说明:

参考：http://www.cnblogs.com/ganganloveu/p/4177690.html

成对删除两个不同的元素，最后剩下的就是Majority elemen.

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