public class Solution { public int[] solve(int[] A) { int n = A.length; int maxVal = Integer.MIN_VALUE; int maxIndex = -1; int sMaxVal = Integer.MIN_VALUE; int sMaxIndex = -1; for (int i = 0; i < n; i ++) { if (A[i] > maxVal) { sMaxVal = maxVal; sMaxIndex = maxIndex; maxVal = A[i]; maxIndex = i; } else if (A[i] > sMaxVal) { sMaxVal = A[i]; sMaxIndex = i; }
} int[] result = new int[n - 2]; int p = 0; for (int i = 0; i < n; i ++) { if (i == maxIndex || i == sMaxIndex) { continue; } result[p ++] = A[i]; } return result; } }