leetcode 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

解答一:

class Solution:
    def isValid(self, s):
        """
        :type s: str
        :rtype: bool
        """
        # 如下这两行代码可有可无,有的话,测试代码计算会稍微快几毫秒,没的话代码看起来更简洁
        #if len(s)%2 != 0:
        #    return False
        while s:
            len1 = len(s)
            for i in ['()','[]','{}']:
                if i in s:
                    s = s.replace(i,'')
            len2 = len(s)
            if len1==len2:
                return False
        return True

解答二:

class Solution:
    def isValid(self, s):
        """
        :type s: str
        :rtype: bool
        """
        length = len(s)
        if length%2 != 0:
            return False
        count = 0
        while s and count<length/2:
            for i in ['()','[]','{}']:
                if i in s:
                    s = s.replace(i,'')
            count += 1
        if s:
            return False
        else:
            return True

 

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值