[leetcode]Majority Element

寻找数组中的多数元素

最新推荐文章于 2019-02-22 16:24:01 发布

原创最新推荐文章于 2019-02-22 16:24:01 发布 · 904 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode

leetcode实现每周一题专栏收录该内容

14 篇文章

订阅专栏

原题

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.

Credits:
Special thanks to @ts for adding this problem and creating all test cases.

思路

This problem is required to get the majority element appeard. As it appears more than [n/2] times. So we can compare two elements, if they do not have the same value, we can delete them. And at last, the only left element must be the one we want to get. The time complexity is O(n)

代码

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