{
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 )
sec_max = data[i]
}
}
return sec_max
}
招聘笔试题2018-11-22才子老师
{
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 )
sec_max = data[i]
}
}
return sec_max
}
2018中行笔试题和面试题答案目