Leetcode 20. Valid Parentheses

最新推荐文章于 2024-03-12 19:30:00 发布

IT莫莫

最新推荐文章于 2024-03-12 19:30:00 发布

阅读量176

点赞数

分类专栏： Leetcode

本文链接：https://blog.csdn.net/gt362ll/article/details/86711912

版权

Leetcode 专栏收录该内容

31 篇文章 0 订阅

订阅专栏

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

An input string is valid if:

Open brackets must be closed by the same type of brackets.
Open brackets must be closed in the correct order.

Note that an empty string is also considered valid.

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

很常规的一道题，用栈来验证，遇到左边入栈，遇到右边出栈看和当前的符号是否匹配。

class Solution(object):
    def isValid(self, s):
        """
        :type s: str
        :rtype: bool
        """
        q=[]
        for i in s:
            if i in ['(','{','[']:
                q.append(i)
            else:
                if q==[]:
                    return False
                else:
                    sign=q.pop()
                    if i==')':
                        if sign!='(':
                            return False
                    if i=='}':
                        if sign!='{':
                            return False
                    if i==']':
                        if sign!='[':
                            return False
        if q==[]:
            return True
        else:
            return False