1
class Solution {
2
  public int secondHighest(String s) {
3
    int[] arr = new int[10];
4
    for (int i = 0; i < s.length(); i++) {
5
      if (s.charAt(i) - '0' <= 9 & s.charAt(i) - '0' >= 0) {
6
        arr[s.charAt(i) - '0']++;
7
      }
8
    }
9
    boolean first = false;
10
    for (int i = 9; i >= 0; i--) {
11
      if (arr[i] != 0) {
12
        if (first) return i;
13
        else first = true;
14
      }
15
    }
16

17
    return -1;
18
  }
19
}