[leetcode] 942. DI String Match

Description

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]

Example 3:

Input: "DDI"
Output: [3,2,0,1]

Note:

1. 1 <= S.length <= 10000
2. S only contains characters “I” or “D”.

分析

题目的意思是：给定一个只包含I和D的字符串，I位置当前的数要比下一个位置的小，D位置当前的数要比下一个位置大。我的思路也很直接，维护一个最大值h，最小值l，碰见D我就赋予最大值，h-1,碰见I我就赋予最小值，l+1,这样贪心的做法肯定能找到一组符合条件的数，由于输出的数的长度比字符串长度大1，所以遍历完以后还需要加一个数就行了，我取的就是数l。

代码

class Solution:
    def diStringMatch(self, S: str) -> List[int]:
        l=0
        h=len(S)
        res=[]
        for i in range(len(S)):
            if(S[i]=='D'):
                res.append(h)
                h-=1
            elif(S[i]=='I'):
                res.append(l)
                l+=1
        res.append(l)
        return res

参考文献

LeetCode 942 di-string-match 增减字符串匹配