从0开始的leetCode:Valid Parentheses（再遇反向思维）

我的答案：

 public boolean isValid(String s) {
       Stack<Character> stack=new Stack<>();
        if (s.length()==0) return true;
        stack.push(s.charAt(0));
        for (int i = 1; i < s.length(); i++) {
            if (s.charAt(i)==')'&&!stack.empty()){
                if (stack.peek()!=')'-1)
                    return false;
                else stack.pop();//出栈
            }else if ((s.charAt(i)==']'||s.charAt(i)=='}')&&!stack.empty()){
                if (stack.peek()!=s.charAt(i)-2)
                    return false;
                else stack.pop();//出栈
            }else stack.push(s.charAt(i));//入栈
        }
        if (stack.isEmpty())
            return true;
        else return false;
    }

更简单的答案：

不需要判断到底是什么后括号，也不需要注意stack是否是空

Stack<Character> stack = new Stack<Character>();
	for (char c : s.toCharArray()) {
		if (c == '(')
			stack.push(')');
		else if (c == '{')
			stack.push('}');
		else if (c == '[')
			stack.push(']');
		else if (stack.isEmpty() || stack.pop() != c)
			return false;
	}
	return stack.isEmpty();