int cmp(const void* a,const void* b){
return *(int*)a-*(int*)b;
}
int majorityElement(int* nums, int numsSize) {
qsort(nums,numsSize,sizeof(int),cmp);
int count=0,n=numsSize/2,max=nums[0];
for(int i=1;i<numsSize;i++){
if(nums[i]==nums[i-1]){
count++;
if(count>n){
max=nums[i];
break;
}
}else{
count=1;
}
}
return max;
}
结果:
标签:numsSize,count,const,nums,int,max,元素,169,多数 From: https://www.cnblogs.com/llllmz/p/18076136