LeetCode in Python 20. Valid Parentheses

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 1:

Input: "()"
Output: true

Example 2:

Input: "()[]{}"
Output: true

Example 3:

Input: "(]"
Output: false

Example 4:

Input: "([)]"
Output: false

Example 5:

Input: "{[]}"
Output: true

Solution:

最经典的题之一,遍历字符串放入stack,如果当前字符属于括号的开头,进栈;如果当前字符属于括号的结尾,比较栈顶,不配对返回false,配对出栈,遍历结束栈应该为空,否则返回false。

class Solution(object):
    def isValid(self, s):
        """
        :type s: str
        :rtype: bool
        """
        st = []
        for char in s:
            if char == '(' or char == '[' or char == '{':
                st.append(char)
                continue
            
            if not st:
                return False
            
            if char == ')' and st[-1] != '(':
                return False
            
            if char == ']' and st[-1] != '[':
                return False
            
            if char == '}' and st[-1] != '{':
                return False
            
            st.pop()
            
        return (not st)

还有一种带点trick味道的解法:

class Solution(object):
    def isValid(self, s):
        """
        :type s: str
        :rtype: bool
        """
        while '()' in s or '[]' in s or '{}' in s:
            s = s.replace('()','').replace('[]','').replace('{}','') 
        return (not s)

注意python字符串replace后要赋值,不然原字符串无变化。




转载于:https://www.cnblogs.com/lowkeysingsing/p/11206912.html

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值