1
Example1：
2
Input: “()[]{}”
3
Output: true
4

5
Example2:
6
Input: “([)]”
7
Output: false

1
# @Author：Kilien
2
# @lc app=leetcode id=20 lang=python3
3
#
4
# [20] Valid Parentheses
5
# 思路：使用hashtable标记括号，拆分字符串
6
# 若字符串不在hashtable中，模拟入栈
7
# 若栈不为空，栈顶元素出栈，匹配括号则消除，不匹配则报错
8
class Solution:
9
    def isValid(self, s: str) -> bool:
10
        stack = []
11
        par_map = {')':'(',']':'[','}':'{'}
12

13
        for c in s:
14
            if c not in par_map:
15
                stack.append(c)
16
            elif not stack or par_map[c] != stack.pop():
17
                return False
18
        return not stack