leetcode 日经贴，python code -Valid Parentheses
2015-02-10 22:38
471 查看
Valid Parentheses
class Solution:
# @return a boolean
def isValid(self, s):
st = []
for x in s:
if x in ('(', '[', '{'):
st.append(x)
elif len(st) > 0:
if x == ')' and st[-1] == '(' or \
x == ']' and st[-1] == '[' or \
x == '}' and st[-1] == '{':
st.pop()
else:
return False
else:
return False
return False if st else True
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- leetcode 日经贴，python code -Longest Valid Parentheses
- leetcode 日经贴，python code -Different Ways to Add Parentheses
- 20. Valid Parentheses Leetcode Python
- Python学习——leetcode(Valid Parentheses)
- [leetcode:python]20.Valid Parentheses
- 【Leetcode】【python】Longest Valid Parentheses
- Leetcode-Valid Parentheses-Python
- [leetcode]Longest Valid Parentheses @ Python
- leetcode Valid Parentheses python
- 32. Longest Valid Parentheses leetcode python new season 2016
- [LeetCode]题解（python）：032-Longest Valid Parentheses
- [LeetCode]题解（python）：020-Valid Parentheses
- [leetcode] Valid Parentheses @Python
- [Leetcode]32. Longest Valid Parentheses @python
- python写算法题：leetcode: 32. Longest Valid Parentheses
- [leetcode]Valid Parentheses @ Python
- [leetcode] Longest Valid Parentheses @python
- LeetCode 20 Valid Parentheses (C,C++,Java,Python)
- Longest Valid Parentheses @Leetcode -- Python
- 【leetcode】20. Valid Parentheses（Python & C++）