[LeetCode]DI String Match@Python

最新推荐文章于 2024-11-07 18:59:45 发布

Goofiness

最新推荐文章于 2024-11-07 18:59:45 发布

阅读量92

点赞数

分类专栏： leetcode 双指针文章标签： leetcode python

本文链接：https://blog.csdn.net/byr_wy/article/details/89383484

版权

leetcode 同时被 2 个专栏收录

232 篇文章 0 订阅

订阅专栏

双指针

1 篇文章 0 订阅

订阅专栏

DI String Match

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

Input: “IDID”
Output: [0,4,1,3,2]

Solution

class Solution:
    def diStringMatch(self, S: str) -> List[int]:
        l, r, ret = 0, len(S), []
        for s in S:
            ret.append(l if s=='I' else r)
            l, r = l+int(s=='I'), r-int(s=='D')
        return ret+[l]