942. DI String Match

942. DI String Match 下班到家后,刷了刷leetcode,发现了一道颇有意思的小题,题目以下:java Given a string S that only contains “I” (increase) or “D” (decrease), let N = S.length.web Return any permutation A of [0, 1, …, N] such t
相关文章
相关标签/搜索