LeetCode 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.

/*************************************************************************
    > File Name: LeetCode169.c
    > Author: Juntaran
    > Mail: Jacinthmail@gmail.com
    > Created Time: Tue 10 May 2016 02:40:25 PM CST
 ************************************************************************/
 
/*************************************************************************

    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.

 ************************************************************************/

#include<stdio.h>

int majorityElement( int* nums, int numsSize )
{
    int ret = nums[0];
    int count = 1;
    
    int i;
    for( i=1; i<numsSize; i++ )
    {
        if( ret == nums[i] )
        {
            count ++;
        }
        else
        {
            count --;
        }
        if( count == 0 )
        {
            ret = nums[i];
            count ++;
        }
    }
    return ret;
}

int main()
{
    int nums[] = {3,2,3};
    int numsSize = 3;

    int ret = majorityElement( nums, numsSize );
    printf("%d
", ret);

    return 0;
}