数组中出线次数超过一半的元素

国外资料：http://www.cs.utexas.edu/~moore/best-ideas/mjrty/index.html

#include <stdio.h>
#include <limits.h>

int findMoreThanHalf(int* arr, int n)
{
	int val = arr[0];
	int cnt = 1;


	for(int i = 0; i < n; i++)
	{
		if(arr[i] == val)
			cnt++;
		else
		{
			cnt--;
			if(cnt < 0)
			{
				val = arr[i];
				cnt++;
			}
		}
	}

	return val;
};

int main()
{
	int numbers[] = {5,5,5,3,3,1,1,3,3,3,1,3,3};

	int res = findMoreThanHalf(numbers, 13);

	return 0;
}