1.3.4 Parentheses

2019独角兽企业重金招聘Python工程师标准>>>

题目

编写一个 Stack 的用例 Parentheses，从标准输入中读取一个文本流并使用栈判定其中的括号是否配对完整。例如，对于 [()]{}{()()} 程序应该打印 true，对于 [(]) 则打印 false。

---

解答

遇到左括号就入栈，遇到右括号就检查是否和栈顶的左括号匹配，如果匹配则弹栈，否则返回 false。结束时如果栈不为空则返回 false，否则返回 true

---

代码

package basic;

import java.util.Scanner;
import java.util.Stack;

public class Parentheses {
    private static final char LEFT_PAREN = '(';
    private static final char RIGHT_PAREN = ')';
    private static final char LEFT_BRACE = '{';
    private static final char RIGHT_BRACE = '}';
    private static final char LEFT_BRACKET = '[';
    private static final char RIGHT_BRACKET = ']';

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        System.out.println("...输入exit退出程序...");
        while (true) {
            if (scanner.hasNext()) {
                String input = scanner.nextLine();
                if ("exit".equals(input)) {
                    System.out.println("...程序即将退出...");
                    break;
                }
                System.out.println("...Your input :" + input + "...");
                System.out.println(isBalanced(input));
            }
        }
    }

    public static boolean isBalanced(String s) {
        Stack<Character> stack = new Stack<Character>();
        for (int i = 0; i < s.length(); i++) {
            char c = s.charAt(i);
            if (c == LEFT_PAREN || c == LEFT_BRACE || c == LEFT_BRACKET) {
                stack.push(c);
            }
            if (stack.isEmpty()) {
                return false;
            }
            if ((c == RIGHT_PAREN && stack.peek() == LEFT_PAREN)
                    || (c == RIGHT_BRACE && stack.peek() == LEFT_BRACE)
                    || (c == RIGHT_BRACKET && stack.peek() == LEFT_BRACKET)) {
                stack.pop();
            }
        }
        return stack.isEmpty();
    }

}

转载于:https://my.oschina.net/Cubicluo/blog/3034202