【leetcode】数组中出现次数超过一半的数字

 

int cmp_up(void *a, void *b)
{
    return *(int *)a - *(int *)b;
}

int majorityElement(int *nums, int numsSize)
{
    qsort(nums, numsSize, sizeof(int), cmp_up);
    return nums[numsSize / 2];
}