32.leetCode 20. Valid Parentheses
2018-01-16 09:06
351 查看
【题目】:
Given a string containing just the characters
determine if the input string is valid.
The brackets must close in the correct order,
all valid but
not.
【分析】:
从左到右遍历字符串,将当前字符与前一个的字符进行比较,若成对则将之前的字符删除。若是左括号,则放入到栈中。
【Python代码】:
class Solution:
def isValid(self, s):
"""
:type s: str
:rtype: bool
"""
if len(s)%2 == 1:
return False
map = {')':'(',']':'[','}':'{'}
brackets = []
for item in s:
if brackets:
bracket = brackets[-1]
else:
brackets.append(item)
continue
if item in map.values():
brackets.append(item)
if item in map.keys():
if map[item] == bracket:
brackets.pop()
else:
return False
if brackets:
return False
else:
return True
Given a string containing just the characters
'(',
')',
'{',
'}',
'['and
']',
determine if the input string is valid.
The brackets must close in the correct order,
"()"and
"()[]{}"are
all valid but
"(]"and
"([)]"are
not.
【分析】:
从左到右遍历字符串,将当前字符与前一个的字符进行比较,若成对则将之前的字符删除。若是左括号,则放入到栈中。
【Python代码】:
class Solution:
def isValid(self, s):
"""
:type s: str
:rtype: bool
"""
if len(s)%2 == 1:
return False
map = {')':'(',']':'[','}':'{'}
brackets = []
for item in s:
if brackets:
bracket = brackets[-1]
else:
brackets.append(item)
continue
if item in map.values():
brackets.append(item)
if item in map.keys():
if map[item] == bracket:
brackets.pop()
else:
return False
if brackets:
return False
else:
return True
相关文章推荐
- leetcode 20|22|32. Valid Parentheses 22. Generate Parentheses 32. Longest Valid Parentheses
- [Leetcode] 20. Valid Parentheses
- leetcode 32. Longest Valid Parentheses
- [leetcode]20. Valid Parentheses
- [Leetcode 20, Easy] Valid Parentheses
- leetcode 32. Longest Valid Parentheses——(use stack)
- leetcode 20. Valid Parentheses
- [leetcode:python]20.Valid Parentheses
- leetcode20 Valid Parentheses 有效的括号
- [leetcode] 20. Valid Parentheses
- Leetcode 32 - Longest Valid Parentheses
- LeetCode(32)Longest Valid Parentheses
- leetcode - 32.Longest Valid Parentheses
- leetcode 32 Longest Valid Parentheses
- leetcode 32. Longest Valid Parentheses
- 【LeetCode】20. Valid Parentheses
- 20. Valid Parentheses LeetCode
- leetcode 32 : Longest Valid Parentheses
- 2017.10.28 LeetCode - 20. Valid Parentheses - 112. Path Sum
- Leetcode题解 - 20. Valid Parentheses