LeetCode —— 【20. 有效的括号】

最新推荐文章于 2024-01-16 18:43:58 发布

ChaoFeiLi

最新推荐文章于 2024-01-16 18:43:58 发布

阅读量113

点赞数

分类专栏：数据结构

本文链接：https://blog.csdn.net/ChaoFeiLi/article/details/100109012

版权

数据结构专栏收录该内容

25 篇文章 3 订阅

订阅专栏

JAVA

class Solution {
    public boolean isValid(String s) {
        Stack<Character> stack = new Stack<Character>();
        char [] chars = s.toCharArray();
        for (char c:chars){
            if (c=='('||c=='['||c=='{'){
                stack.add(c);
            }else {
                if (stack.isEmpty()) return false;
                if (c==')'&&stack.pop()!='(') return false;
                if (c==']'&&stack.pop()!='[') return false;
                if (c=='}'&&stack.pop()!='{') return false;
            }
        }
        return stack.isEmpty();
        
    }
}

python

class Solution:
    def isValid(self, s: str) -> bool:
        if len(s) == 1:
            return False
        if len(s) == 0:
            return True
        stack = [None]
        listDict = {')': "(", ']': "[", '}': "{"}
        for i in s:
            if i in listDict and listDict[i] ==stack[-1]:
                stack.pop()
            else:stack.append(i)
        if len(stack) == 1:
            return True
        else:
            return False