有效的括号——Leetcode

最新推荐文章于 2024-10-16 12:19:08 发布

AllenC6

最新推荐文章于 2024-10-16 12:19:08 发布

阅读量80

点赞数

分类专栏： Leetcode 文章标签：数据结构算法

本文链接：https://blog.csdn.net/m0_37707561/article/details/124320763

版权

Leetcode 专栏收录该内容

31 篇文章 0 订阅

订阅专栏

public class IsValid {

    public static void main(String[] args) {
        int a = '(' + ')';
        System.out.println(a);
        int b = '{' + '}';
        System.out.println(b);
        int c = '[' + ']';
        System.out.println(c);

        isValid("(){}}{");
    }

    //前后顺序必须对
    public static boolean isValid(String s) {
        Stack<Character> stack = new Stack<>();
        for (int i = 0; i < s.length(); i++) {
            Character char2 = s.charAt(i);
            if (!stack.isEmpty()) {
                Character char1 = stack.peek();
                if (isValid(char1, char2)) {
                    stack.pop();
                }else {
                    stack.push(char2);
                }
            }else {
                stack.push(char2);
            }
        }

        return stack.isEmpty();
    }
    public static boolean isValid(Character char1, Character char2) {
        if ((char1 + char2 == 81 && char1 < char2)|| (char1 + char2 == 248 && char1 < char2) || (char1 + char2 == 184 && char1 < char2)) {
            return true;
        }
        return false;
    }
}