用栈检查括号合法性 20. Valid Parentheses

最新推荐文章于 2022-03-04 16:30:56 发布

WindowsSucks

最新推荐文章于 2022-03-04 16:30:56 发布

阅读量255

点赞数

分类专栏：算法

本文链接：https://blog.csdn.net/weixin_44015873/article/details/85553084

版权

算法专栏收录该内容

25 篇文章 0 订阅

订阅专栏

简单题，吃饭前写着玩玩

import java.util.*;
class Solution {
    public boolean isValid(String s) {
        if(s.length() == 0)
            return true;
        boolean ret = true;
        int length = s.length();
        Stack<Character> stack = new Stack<Character>();
        for(int i=0; i < length; i++) {
            char parenth = s.charAt(i);
            if(parenth == '[' || parenth == '{' || parenth == '(') {
                stack.push(parenth);
            }
            else if(parenth == ']' || parenth == '}' || parenth == ')') {
                if(stack.empty())
                    return false;
                char opposite = stack.pop();
                if(parenth == ']' && opposite != '[')
                    ret = false;
                else if(parenth == '}' && opposite != '{')
                    ret = false;
                else if(parenth == ')' && opposite != '(')
                    ret = false;
            }
        }
        if(!stack.empty())
            return false;
        return ret;
    }
}