Q:
给定只含 "I"
(增大)或 "D"
(减小)的字符串 S
,令 N = S.length
。
返回 [0, 1, ..., N]
的任意排列 A
使得对于所有 i = 0, ..., N-1
,都有:
- 如果
S[i] == "I"
,那么A[i] < A[i+1]
- 如果
S[i] == "D"
,那么A[i] > A[i+1]
示例 1:
输出:"IDID" 输出:[0,4,1,3,2]
示例 2:
输出:"III" 输出:[0,1,2,3]
示例 3:
输出:"DDI" 输出:[3,2,0,1]
https://leetcode-cn.com/problems/di-string-match/description/
思路: "IDID" 看这个字符串,其实规律就是当字符串是I的时候由小到大插入,当字符串为D的时候由大到小插入,最后插入剩余的
class Solution:
def diStringMatch(self, S):
"""
:type S: str
:rtype: List[int]
"""
res = []
temp = [i for i in range(len(S)+1)]
left = 0
right = len(temp) - 1
for key in S:
if key == 'I':
res.append(left)
left+=1
else:
res.append(right)
right-=1
res.append(max(right,left))
return res