/大佬勿喷本人菜鸡/
int moreThanHalfNum_Solution(int* nums, int numsSize) {
int i;
int map[numsSize];
for(i = 0;i < numsSize;i)
{
map[i] = 0;
}
for(i = 0;i < numsSize;i)
{
if(nums[i] > numsSize)
{
continue;
}
map[nums[i]]++;
}
for(i = 0;i[HTML_REMOVED] numsSize)
{
continue;
}
if(map[nums[i]] > numsSize / 2)
{
return nums[i];
}
}
}