Leetcode 169

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

if(i=nums.size()-2)
return nums[nums.size()-2];
}
}
};