找到数组中第二大的数

package com.pigetest.util.leet.code;

public class Find2rdMaxNumber {
    public static int find2rdMaxNumber(int[]num){
        int max=Integer.MIN_VALUE;
        int secondMax=Integer.MIN_VALUE;
        for(int i=0;i<num.length;i++){
            if(num[i]>max){
                secondMax=max;
                max=num[i];
            }else if(num[i]>secondMax){
                secondMax=num[i];
            }
        }
        return secondMax;
    }

    public static void main(String[] args) {
        int[]num={1,6,5,4,7,8,10,6,24,11,23};
        System.out.println(find2rdMaxNumber(num));
    }
}