DI String Match LeetCode solution in Python

1
class Solution:
2
    def diStringMatch(self, s: str) -> List[int]:
3
        result = []
4
        min_ = 0
5
        max_ = len(s)
6
        for x in s:
7
            if x == "I":
8
                result.append(min_)
9
                min_ += 1
10
            elif x == "D":
11
                result.append(max_)
12
                max_ -= 1
13
        result.append(min_)
14
        return result