#include
#include
#include
using namespace std;
int main()
{
int n = 0;
cin >> n;
vectorarr(n);
for (int& a : arr)
cin >> a;
for (int i = 0;i < arr.size() - 1;i++)
{
for (int j = 0;j < arr.size() - 1 - i;j++)
{
if (arr[i] > arr[i + 1])
{
int tmp = arr[i];
arr[i] = arr[i + 1];
arr[i + 1] = tmp;
}
}
}
vectorres(n,0);
for (int i = 0;i < n;i++)
{
for (int j = i;j < n;j++)
{
if (arr[i] == arr[j])
res[i]++;
}
}
int i = 0;
int max = LONG_MIN;
int j = 0;
for (i = 0;i < n;i++)
{
if (res[i] > max)
{
max = arr[i];
j = i;
}
}
if ((double)res[j] / (double)n > 0.5)
{
cout << arr[j];
}
else
cout << “none”;
return 0;
}
找出一个数组中出现次数过半的数字
最新推荐文章于 2022-04-29 13:43:45 发布