[leetcode] problem 942 – di string match

public int[] diStringMatch(String S) {
    int n = S.length();
    int left = 0;
    int right = n;
    int[] result = new int[n + 1];

    for (int i = 0; i < n; i++) {
        if (S.charAt(i) == 'I')
            result[i] = left++;
        else
            result[i] = right--;
    }
    result[n] = left;

    return result;
}