LeetCode-20 Valid Parentheses

Description

Given a string containing just the characters ‘(’, ‘)’, ‘{’, ‘}’, ‘[’ and ‘]’, determine if the input string is valid.

An input string is valid if:
1.Open brackets must be closed by the same type of brackets.
2.Open brackets must be closed in the correct order.

Note that an empty string is also considered valid.

Example

Example 1:
Input: “()”
Output: true

Example 2:
Input: “()[]{}”
Output: true

Example 3:
Input: “(]”
Output: false

Example 4:
Input: “([)]”
Output: false

Example 5:
Input: “{[]}”
Output: true

Submissions

这道题的解题思路主要是运用栈的思想。首先如果字符串s为空则直接返回True，如果字符串s的长度为奇数则直接返回False.之后初始化栈l，利用Python中的字典建立开闭括号的匹配关系。遍历字符串，如果遇到开括号就入栈，如果遇到闭括号就出栈，且通过建立的字典dic检查栈顶的元素，如果栈顶的元素是一个相同类型的开括号，则继续遍历，否则返回False。最后遍历完字符串判断栈l是否为空，如果为空则说明字符串为有效括号。

注：
l.append # 入栈
l.pop() # 出栈并获取栈顶元素
len(l) == 0 # 栈为空

实现代码如下：

class Solution:
    def isValid(self, s: str) -> bool:
        if s == "":
            return True
        if len(s) % 2 != 0:
            return False
        l = []
        dic = { "(":")", "{":"}", "[":"]" }
        for i in range(len(s)):
            if s[i] in dic:
                l.append(s[i])
            else:
                if len(l)==0 or dic[l.pop()]!= s[i]:
                    return False
        return len(l)==0