LeetCode 169 Majority Element

Array LeetCode

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.

题意

代码

C语言版本：

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