求数组中第二大的数

public class JinShanDemo00 {

/**
* @param args
* @author guozw
* 求数组中第二大的数 
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
int[] a = new int[]{-22, 33, 43, 0, 109, -1, 101, 82, 23, 333,8, 11, 209,530};
int secondNum = getSecondMax(a);
System.out.println(secondNum);
}

/**/
private static int getSecondMax(int[] as){
//as.length < 2
if(as.length<2){
System.out.println("as.length < 2.");
return as[0];
}

int maxNum; //最大数
int secondNum; //第二大数
int t; //中转数
maxNum = as[0];
secondNum = as[1];
if(maxNum < secondNum){
t = maxNum;
maxNum = secondNum;
secondNum = t;
}

for(int i=2;i<as.length;i++){
if(as[i]>secondNum){
if(as[i]>maxNum){
t = maxNum;
secondNum = t;
maxNum = as[i];
}else{
if(as[i]>secondNum){
secondNum = as[i];
}
}
}
}
//return maxNum;
return secondNum;
}
}