数组中出现次数超过一半的数字(算法)

class Solution {
public:
int MoreThanHalfNum_Solution(vector<int> numbers) {
int len = numbers.size();
if(len <= 0) return  0;

int times = 0;
int num = numbers[0];
for(int i = 0; i < len;i++)
{
if(times == 0)
{
times = 1;
num = numbers[i];
}
else
{
if(num == numbers[i])
times++;
else
times--;
}
}
times = 0;
for(int i = 0; i < len; i++)
{
if(num == numbers[i])
times++;
}
if(times * 2 > len)
return num;

return 0;
}
};