Majority Element

题目：

Given an array of size n, find the majority element. The majority element is the element that appearsmore than ⌊ n/2 ⌋ times.

You may assume that the array is non-empty and the majority element always exist in the array.

分析：

大于一半的众数用一个数记录每个数出现的次数，不是这个数减一，最后非0数是要求的数。

代码：

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