数组中占比超过一半的元素称之为主要元素。给定一个整数数组,找到它的主要元素。若没有,返回-1。
示例1:
输入:[1,2,5,9,5,9,5,5,5]
输出:5
示例2:
输入:[3,2]
输出:-1
示例3:
输入:[2,2,1,1,1,2,2]
输出:2
代码:
int majorityElement(int* nums, int numsSize)
{
int i, j, flag, length = 0, mode, maxtime;
int *a = (int *)malloc(sizeof(int) * numsSize);
int *b = (int *)malloc(sizeof(int) * numsSize);
if(numsSize == 1)
{
return nums[0];
}
else
{
a[0] = nums[0];
b[0] = 1;
length = 1;
for(i = 1; i < numsSize; i++)
{
flag = 0;
for(j = 0; j < length; j++)
{
if(a[j] == nums[i])
{
b[j]++;
flag = 1;
}
}
if(flag == 0)
{
a[length] = nums[i];
b[length] = 1;
length++;
}
}
mode = a[0];
maxtime = b[0];
for(j = 0; j < length; j++)
{
if(maxtime <= b[j])
{
mode = a[j];
maxtime = b[j];
}
}
if((double)maxtime / (double)numsSize > 0.5)
{
return mode;
}
else
{
return -1;
}
}
}