[LeetCode] Valid Parentheses

https://leetcode.com/problems/valid-parentheses/

Valid Parentheses - LeetCode

괄호가 정상적인지 찾는 스택의 대표 문제

class Solution:
    def isValid(self, s: str) -> bool:
        types = { ')' : '(', ']' : '[', '}': '{' }
        stack = []
        for par in s:
            if par in types:
                if not stack or types[par] != stack.pop():
                    return False
            else:
                stack.append(par)
        return len(stack) == 0