# class Solution(object):
# def isValid(self, s):
#
class Solution:
def isValid(self, s):
"""
:type s: str
:rtype: bool
"""
if s is None:
return True
stack = []
for t in s:
if t == ')':
try:
current = stack.pop()
if current != '(':
return False
except:
return False
elif t == '}':
try:
current = stack.pop()
if current != '{':
return False
except:
return False
elif t == ']':
try:
current = stack.pop()
if current != '[':
return False
except:
return False
else:
stack.append(t)
if len(stack) == 0:
return True
else:
return False
# def isValid(self, s):
# # python replace
# n = len(s)
# if n == 0:
# return True
#
# if n % 2 != 0:
# return False
#
# while '()' in s or '{}' in s or '[]' in s:
# s = s.replace('{}', '').replace('()', '').replace('[]', '')
#
# if s == '':
# return True
# else:
# return False
Download Valid Parentheses.pyLeetcode 020 Valid Parentheses problem solution in python3 with explanation. This is the best place to expand your knowledge and get prepared for your next interview.
Feedback is the most important part of any website.
If you have any query, suggestion or feedback, Please feel free to contact us.