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) {
sort(nums.begin(),nums.end());
int n=nums.size();
int count=1,i=0;
if(n==1)
return nums[0];
while(count<=n/2)
{
if(nums[i+1]!=nums[i])
count=1;
else
++count;
++i;
}
return nums[--i];
}
};