Given an array of sizen, 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.

int majorityElement(int* nums, int numsSize) {
    int count=0,major;

    for(int i=0;i<numsSize;i++){
        if(count==0){
            major = nums[i];
            count++;
        }else if(major == nums[i]){
            count++;
        }else{
            count--;
        }
    }
    return major;
}