算法分类:
归纳法,递归
算法原理:
多数元素定义:有整型数组a[1...n],如果整数x在数组a中出现的次数多于半数,则x称为多数元素
算法基于理论:在原序列中去除两个不同的元素后,那么在原序列中的多数元素在新序列中还是多数元素
时空复杂度:
O(n)
代码实现(C):
#include <stdio.h>
int candidate(int a[], int m, int n)
{
int j = m, c = a[m], count = 1;
while (j < n && count > 0)
{
++ j;
if (a[j] == c)
++ count;
else
-- count;
}
if (j == n)
return c;
else
return candidate(a, j+1, n);
};
// a[1...n]
int Majority(int a[], int n)
{
int c = candidate(a, 1, n);
int count = 0;
int majority;
for (int i = 1; i <= n; ++ i)
if (a[i] == c)
++ count;
if (n%2 == 0)
majority = n/2 + 1;
else
majority = n/2;
if (count > majority)
return c;
else
return -1;
};
int main()
{
int a[11];
for (int i = 1; i < 11; ++ i)
scanf("%d",a+i);
printf("%d\n",Majority(a, 10));
getchar();
getchar();
}