题目:
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.
代码: int majorityElement(vector<int>& nums) {
unordered_map<int, int> uMap;
for(int i = 0; i < nums.size(); ++i)
{
uMap[nums[i]]++;
if( uMap[nums[i]] > nums.size()/2)
return nums[i];
}
}