寻找数组中第二大数

//绝对原创

#include <iostream>

using namespace std;
int findsecondmax(int *Num,int length)
{
int Maxs[2];
int *pSmax;
Maxs[0]=Num[0];
Maxs[1]=Num[1];
pSmax=Maxs[0]<Maxs[1]?Maxs:Maxs+1;
int i;
for(i=2;i<length;i++)
{
if(Num[i]>*pSmax)
{
*pSmax=Num[i];
pSmax=Maxs[0]<Maxs[1]?Maxs:Maxs+1;
}
}
return *pSmax;
}


int main() {
// your code goes here
int Number[]={4,2,-6,4,1};
cout<<findsecondmax(Number,5)<<endl;
return 0;
}