Leetcode 20. Valid Parentheses
2023-03-01 10:02 作者:您是打尖兒還是住店呢 | 我要投稿
Given a string?s?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.
Every close bracket has a corresponding open bracket of the same type.
?
Example 1:
Input: s = "()"Output: true
Example 2:
Input: s = "()[]{}"Output: true
Example 3:
Input: s = "(]"Output: false
?
Constraints:
1 <= s.length <= 104s?consists of parentheses only?'()[]{}'.
easy 題目，其實(shí)用stack來做，速度會(huì)提高很多的。
Runtime:?186 ms, faster than?5.93%?of?Java?online submissions for?Valid Parentheses.
Memory Usage:?42.9 MB, less than?5.76%?of?Java?online submissions for?Valid Parentheses.
標(biāo)簽：Leetcode
