169. 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) {
int count = 0;
int majority = nums[0];
for(int i = 0;i<nums.size();++i)
{
if(count == 0)
{
++count;
majority = nums[i];
}
else if(nums[i] == majority)
{
++count;
}
else
{
--count;
}
}

return majority;

}
};