[C语言][LeetCode][169]Majority Element

题目

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.

标签

Array、Divide and Conquer、Bit Manipulation

难度

简单

分析

题目意思是给定一个数组，找出一个出现次数大于n/2的数，题目假设一定有这个数且数组非空。解题思路是做减法操作，即比较两个数，不相同，就忽略，相同，则计数，那么最后剩下来的那个，就是你要的数。

C代码实现

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