Leetcode-169. Majority Element

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