数组中有一个数字出现的次数超过数组长度的一半,请找出这个数字。例如输入一个长度为9的数组{1,2,3,2,2,2,5,4,2}。由于数字2在数组中出现了5次,超过数组长度的一半,因此输出2。如果不存在则输出0。
class Solution {
public:
bool CheckHalfNum(vector<int> numbers,int result)
{
unsigned long times = 0;
for(unsigned long i = 0; i < numbers.size(); ++i)
{
if(numbers[i] == result)
{
times++;
}
}
bool isMoreHalf = true;
if(times *2 <= numbers.size())
{
isMoreHalf = false;
}
return isMoreHalf;
}
int MoreThanHalfNum_Solution(vector<int> numbers)
{
if(numbers.size() == 0) return 0;
int result = numbers[0];
int times = 1;
for(unsigned long i = 1; i < numbers.size(); ++i)
{
if(times == 0)
{
result = numbers[i];
times = 1;
}
else if(numbers[i] == result)
{
times++;
}
else
{
times--;
}
}
if(!CheckHalfNum(numbers,result))
{
result = 0;
}
return result;
}
};