力扣942——增减字符串匹配（递增序列取两端）

看过题解，AC

class Solution {
    public int[] diStringMatch(String S) {

        int n = S.length();
        int[] arr = new int [n+1];
        int low = 0;
        int high = n;
        char index;
        for(int i = 0; i < n; i++){
            index = S.charAt(i);
            if(index == 'I')
                arr[i] = low++;
            else
                arr[i] = high--;
        }
        arr[n] = low;
        return arr;
    }
}