DI String Match LeetCode solution in Java

1
class Solution {
2
  public int[] diStringMatch(String s) {
3
    int low = 0;
4
    int high = s.length();
5
    int[] ans = new int[s.length() + 1];
6
    for (int i = 0; i < s.length(); i++) {
7
      if (s.charAt(i) == 'I') {
8
        ans[i] = low++;
9
      } else {
10
        ans[i] = high--;
11
      }
12
    }
13
    ans[s.length()] = high;
14
    return ans;
15
  }
16
}