题目描述
数组中有一个数字出现的次数超过数组长度的一半,请找出这个数字。例如输入一个长度为9的数组{1,2,3,2,2,2,5,4,2}。由于数字2在数组中出现了5次,超过数组长度的一半,因此输出2。如果不存在则输出0。
解法一:基于Partition函数的O(n)方法
这种方法相当于求“第n/2大的数字”。
class Solution {
public:
void swap(vector<int>& number,int x,int y){
int temp=number[x];
number[x]=number[y];
number[y]=temp;
return ;
}
int Partition(vector<int>& numbers,int start,int last){
if(numbers.empty()||start<0||last>=numbers.size())
return 0;
//int index=RandomInRange(start,last);
int index=rand()%(last-start+1)+start;
swap(numbers,last,index);
int small=start-1;
for(index=start;index<last;++index){
if(numbers[index]<numbers[last]){
++small;
if(small!=index){
swap(numbers,small,index);
}
}
}
++small;
swap(numbers,small,last);
return small;
}
bool CheckMoreThanHalf(vector<int>& numbers,int value){
int times=0;
for(auto data:numbers){
if(data==value) ++times;
}
bool MoreThanHalf=true;
if(2*times<=numbers.size())
MoreThanHalf=false;
return MoreThanHalf;
}
int MoreThanHalfNum_Solution(vector<int> numbers) {
if(numbers.empty()) return 0;
int mid=numbers.size()>>1;
int start=0;
int last=numbers.size()-1;
int index=Partition(numbers,start,last);
while(index!=mid){
if(index>mid){
last=index-1;
index=Partition(numbers,start,last);
}else{
start=index+1;
index=Partition(numbers,start,last);
}
}
int result=numbers[mid];
if(!CheckMoreThanHalf(numbers,result))
result=0;
return result;
}
};
解答二:结合本题特点分析的O(N)算法
class Solution {
public:
bool CheckMoreThanHalf(vector<int>& numbers,int value){
int times=0;
for(auto data:numbers){
if(data==value) ++times;
}
bool MoreThanHalf=true;
if(2*times<=numbers.size())
MoreThanHalf=false;
return MoreThanHalf;
}
int MoreThanHalfNum_Solution(vector<int> numbers) {
if(numbers.empty()) return 0;
int result=numbers[0];
int times=1;
for(int i=1;i<numbers.size();++i){
if(times==0){
result=numbers[i];
times=1;
}else if(numbers[i]==result)
++times;
else
--times;
}
if(!CheckMoreThanHalf(numbers,result))
result=0;
return result;
}
};