LeetCode 20 – Python 3 (Week 1 – 02)

Tclass Solution:
     def isValid(self, s: str) -> bool:
    #The last character should be the corresponding bracket of the first character, thus, we can use stack.
    #One open bracket must be closed by the same type of close bracket. So, we can use dictionary.

    stack = []
    bracket = {'(':')', '{': '}', '[' : ']'}

    for parenthes in s:
        if parenthes in bracket:
            stack.append(parenthes)

        elif len(stack) == 0 or parenthes != bracket[stack.pop()]: #parenthes != bracket[stack.pop()] or len(stack) == 0 is not right
            return False

    return len(stack) == 0 #All open brackets have same type of close brackets.