#include <iostream>
using namespace std;
const int MINNUMBER = -32767 ;
int find_sec_max( int data[], int count)
{
int maxnumber = data[0] ;
int sec_max = MINNUMBER ;
for (int i = 1 ; i < count ; i++)
{
if ( data[i] > maxnumber )
{
sec_max = maxnumber ;
maxnumber = data[i] ;
}
else
{
if ( data[i] > sec_max && data[i] != maxnumber)
sec_max = data[i];
}
}
return sec_max ;
}
int main()
{
int a[] = {1, 1, 4, 4, 3, 3, 1, 2, 1, 1, 5};
int length = sizeof(a) / sizeof(a[0]);
int res = find_sec_max(a, length);
printf("%d\n", res);
return 0;
}
在一组数中找出第二大的数,用单重for循环(C语言)
最新推荐文章于 2021-05-24 21:45:03 发布