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>& nums) {
        if (nums.size() == 1) {
            return nums[0];
        }

        int num = nums[0];
        int cnt = 1;
        for (int i = 1; i < nums.size(); ++i) {
            if (cnt == 0) {
                num = nums[i];
                cnt = 1;
                continue;
            }

            if (num == nums[i]) {
                ++cnt; 
            }
            else {
                --cnt;
            }
        }
        return num;
    }
};