【leetcode】942. DI String Match

 

class Solution {
    public int[] diStringMatch(String S) {
        char[] chs = S.toCharArray();
        int[] A = new int[chs.length+1];
        int low = 0;
        int high = chs.length;
        for (int i=0; i<chs.length; i++) {
            if (chs[i]=='I') {
                A[i] = low++;
            } else {
                A[i] = high--;
            }
        }
        A[chs.length] = chs[chs.length-1]=='I'?low:high;
        return A;
    }
}