加入收藏 | 设为首页 | 会员中心 | 我要投稿 李大同 (https://www.lidatong.com.cn/)- 科技、建站、经验、云计算、5G、大数据,站长网!
当前位置: 首页 > 大数据 > 正文

20. Valid Parentheses

发布时间:2020-12-16 18:14:37 所属栏目:大数据 来源:网络整理
导读:Given a string containing just the characters ‘(‘,‘)’,‘{‘,‘}’,‘[’ and ‘]’,determine if the input string is valid. The brackets must close in the correct order,“()” and “()[]{}” are all valid but “(]” and “([)]” are not.

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

The brackets must close in the correct order,“()” and “()[]{}” are all valid but “(]” and “([)]” are not.

括号匹配问题

func isValid(s string) bool {
    stack := []byte{}
    for i := 0; i < len(s); i++ {
        switch s[i] {
        case '(','[','{':
            stack = append(stack,s[i])
        case ')':
            if len(stack) > 0 && stack[len(stack)-1] == '(' {
                stack = stack[:len(stack)-1]
            } else {
                return false
            }
        case ']':
            if len(stack) > 0 && stack[len(stack)-1] == '[' {
                stack = stack[:len(stack)-1]
            } else {
                return false
            }
        case '}':
            if len(stack) > 0 && stack[len(stack)-1] == '{' {
                stack = stack[:len(stack)-1]
            } else {
                return false
            }
        }
    }
    return (len(stack) == 0)
}

(编辑:李大同)

【声明】本站内容均来自网络,其相关言论仅代表作者个人观点,不代表本站立场。若无意侵犯到您的权利,请及时与联系站长删除相关内容!

    推荐文章
      热点阅读