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.

分析：

上来就想到利用map

class Solution {
public:
int majorityElement(vector<int>& nums) {
size_t m = nums.size() / 2;
map<int,int> nums_count;
vector<int>::iterator it = nums.begin();
while(it != nums.end())
nums_count[*it++]++;
map<int,int>::iterator it2 = nums_count.begin();
while(it2 != nums_count.end())
{
if( it2->second > m)
return it2->first;
it2++;
}
}
};

另一种思路，好像比我的慢

int majorityElement1(vector<int>& nums) {
sort(nums.begin(), nums.end());
return nums[nums.size()/2];
}