//統計陣列中出現次數超過一半的數字
#include <stdio.h>
int Find(int *arr, int len)
{ 
	int num = 0;         //當前數字
	int times = 0;          //當前數字出現的次數
	int i = 0;    
	for (i = 0; i<len; i++)    
	{
		if (times == 0)        
		{ 
			num = arr[i];
			times = 1; 
		}
		else if (arr[i] == num)
			times++;      
		else           
			times--; 
	}   
	return num;
}
int main()
{
	int arr[] = { 1, 5, 5.2, 5, 4, 3, 5, 5, 5 };
	printf("超過一半的數是：%d\n", Find(arr, sizeof(arr) / sizeof(arr[0])));
	return 0;
}