数组中出现次数超过一半的数字

输入：一个数组．

输出：数组中出现次数超过一半的数字．

注：如果该数字不存在，则需对该数组进行检查，下面的程序假设所要查找的数字是存在的．

#include <stdio.h>
#include <stdlib.h>

static int find(int *, int);

int main(int argc, char *argv[])
{
    int result;
    int array[9] = {1,2,3,2,2,2,5,4,2};
    
    result = find(array, sizeof(array)/sizeof(int));

    printf("%d\n", result);
    return 0;
}

static int find(int *A, int len)
{
    int current, num;
    int i;

    current = A[0];
    num = 1;

    for (i = 1; i < len; ++i)
    {
        if (A[i] != current)
        {
            if (num > 0)
                num--;
            else
            {
                num = 0;
                current = A[i];
            }
        }
        else
            num++;
    }

    return current;
}