【经典】942.DI String Match【排序的变种：按规则排序】

题目 Given a string S that only contains "I" (increase) or "D" (decrease), let N = S.length.java Return any permutation A of [0, 1, ..., N] such that for all i = 0, ..., N-1:数组 If S[i] == "I", then A[i]

>>阅读原文<<