169. Majority Element

//44ms
#include<algorithm>
class Solution {
public:
int majorityElement(vector<int>& nums) {
if(!nums.size()) return false;
if(nums.size()==1) return nums[0];
int len=nums.size();
int max=len/2;
int n=1;
sort(nums.begin(),nums.end());
for(int i=0;i<len-1;i++)
{
if(nums[i]==nums[i+1]) n++;
else n=1;
if(n>max) return nums[i];
}
return false;
}
};