942. DI String Match

#942. DI String Match

Given a string S that only contains “I” (increase) or “D” (decrease), let N = S.length.

Return any permutation A of [0, 1, …, N] such that for all i = 0, …, N-1:

If S[i] == “I”, then A[i] < A[i+1]
If S[i] == “D”, then A[i] > A[i+1]

Example 1:
Input: “IDID”
Output: [0,4,1,3,2]

Example 2:
Input: “III”
Output: [0,1,2,3

设置两个参数increase从0开始，遇到I就加1。decrease从最大开始，遇到D就减1。

var diStringMatch = function(S) {
    var increase=0;
    var decrease=S.length;
    var result=[];
    for(var i=0;i<S.length+1;i++) {
        if(S[i]==="I") {
            result.push(increase);
            increase++;
        }
        else {
            result.push(decrease);
            decrease--
        }
    }
    return result;
};