【LeetCode】169. Majority Element

169. Majority Element

Easy

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

想象擂台赛。 

class Solution {
public:
    int majorityElement(vector<int>& nums) {
        int maj,count=0;
        for(int i=0;i<nums.size();i++){
            if(count==0){    //当前擂台无人
                maj = nums[i];
                count++;
            }
            else if(nums[i]==maj){    //擂台上的人一致
                count++;
            }
            else count--;    //擂台上的人不一致
        }
        return maj;
    }
};