Valid Parentheses(stack)
Given a string containing just the characters'('
,')'
,'{'
,'}'
,'['
and']'
, determine if the input string is valid.
An input string is valid if:
Open brackets must be closed by the same type of brackets.
Open brackets must be closed in the correct order.
Note that an empty string is also considered valid.
Example 1:
Example 2:
Example 3:
Example 4:
Example 5:
分析
loop input, stack 只进头不进尾,遇头压入遇尾弹出计算。
最后判断栈是否空
Last updated