首页 笔记 图片 查字 
所属分类:其它
关键词: LeetCode 有效 括号 Java
浏览:35
内容:

代码:

import java.util.Stack;

// 有效括号
public class ValidParentheses {
    public static void main(String[] args) {
        String input = "({[]})]";
        boolean b = validParentheses(input);
        System.out.println(b);
    }

    static boolean validParentheses(String input) {
        Stack<Character> stack = new Stack<>();
        char c;
        for (int i = 0; i < input.length(); i++) {
            if ('{' == input.charAt(i)) {
                stack.push('}');
            } else if ('(' == input.charAt(i)) {
                stack.push(')');
            } else if ('[' == input.charAt(i)) {
                stack.push(']');
            } else {
                c = input.charAt(i);
                if (stack.isEmpty() || c != stack.pop()) {
                    return false;
                }
            }
        }

        return stack.isEmpty();
    }
}