Leetcode 942. DI String Match

文章作者：Tyan
博客：noahsnail.com  |  CSDN  |  简书

1. Description

2. Solution

• Version 1

class Solution:
    def diStringMatch(self, S):
        n = len(S)
        left = 0
        right = n
        result = []
        for i in range(n + 1):
            if i == n or S[i] == 'I':
                result.append(left)
                left += 1
            else:
                result.append(right)
                right -= 1
        return result

• Version 2

class Solution:
    def diStringMatch(self, S):
        left = 0
        right = len(S)
        result = []
        for ch in S:
            if ch == 'I':
                result.append(left)
                left += 1
            else:
                result.append(right)
                right -= 1
        result.append(left)
        return result

Reference

1. https://leetcode.com/problems/di-string-match/