leetcode 169 Majority Element（难易度：Easy）

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.

代码：

int majorityElement(int* nums, int numsSize) {
    int major = nums[0];
    int 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;
}

原题地址： https://leetcode.com/problems/majority-element/