第二题只要找最大，再往左遍历找第二大。。。看能找到第几大就行 ``` public int count(int[] array) { int max_idx = 0 ,count = 0 ,last = array.length; for(int i =0 ; i< array.length; i++){ if( array[i] == array.length) { max_idx = i ; break; } } for(int i = max_idx ; i>=0 ; i--){ if(array[i] == last){ count++; last--; } } return array.length - count; } ```