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:
<li>If <code>S[i] == "I"</code>, then <code>A[i] < A[i+1]</code></li>
<li>If <code>S[i] == "D"</code>, then <code>A[i] > A[i+1]</code></li>
Example 1:
Input: "IDID" Output: [0,4,1,3,2]
Example 2:
Input: "III" Output: [0,1,2,3]
Example 3:
Input: "DDI" Output: [3,2,0,1]
Note:
<li><code>1 <= S.length <= 10000</code></li>
<li><code>S</code> only contains characters <code>"I"</code> or <code>"D"</code>.</li>