求一组数中第二大的元素，要求葱效率上考虑

public static void main(String[] args) { 
int[] intArray = new int[] {1, -5, 20, 10, 56};   
    System.out.println("the second max integer is : " + search2ndMax(intArray));   
} 
public static int search2ndMax(int[] intArray)   
    {   
        if (intArray == null    
            || intArray.length max){ 
        reulst=max; 
        max=intArray[i]; 
        } 
        } 
        return reulst; 
}