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

int MoreThanHalfNum(int *arr, int len)
{
int ret = 0;
int times = 0;
int i = 0;
for (; i < len; ++i)
{
if (times == 0)
{
ret = arr[i];//将arr[i]的值先保存在ret中
times = 1;
}
else if (arr[i] == ret)
{
times++;
}
else
{
times--;
}

}
return ret;
}
int main()
{
int arr[] = {1, 2, 3, 2, 2, 2, 5, 4, 2};
int ret = MoreThanHalfNum(arr, sizeof(arr)/sizeof(int));
cout << ret << endl;
return 0;
}