面试题：利用栈判断括号是否配对完整

import java.util.Stack;

public class Parentheses {
    public static boolean isParentheses(String s) {
        Stack<Character> stack = new Stack<>();
        for (int i = 0; i < s.length(); i++) {
            char c = (char) s.charAt(i);
            if (c == '{' || c == '[' || c == '(') {
                stack.push(c);
            } else if (c == ')') {
                if (stack.peek() != '(')
                    return false;
                else
                    stack.pop();
            } else if (c == ']') {
                if (stack.peek() != '[')
                    return false;
                else
                    stack.pop();
            } else if (c == '}') {
                if (stack.peek() != '{')
                    return false;
                else
                    stack.pop();
            }
        }
        return true;
    }

    public static void main(String[] args) {
        // TODO Auto-generated method stub
        System.out.println(isParentheses("[(])"));
        System.out.println(isParentheses("[()]{}{[()()]()}"));
    }

}