先入后出(FILO)
Stack<Character> stack = new Stack<>()
stack.size()stack.isEmpty() stack.push(val) stack.pop() //在该操作前,确保 !stack.isEmpty() stack.peek()
[leetcode]20. Valid Parentheses有效括号序列