In the Leetcode Valid Parentheses problem solution in Python programming 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.
Leetcode Valid Parentheses problem solution in Python programming
class Solution:
def isValid(self, s):
stack = []
for x in s:
if x in {'(', '[', '{'}:
stack.append(x)
else:
if not stack or stack.pop() + x not in {'()', '[]', '{}'}:
return False
return not stackAlso read,
- Leetcode Valid Parentheses problem solution in C++
- Leetcode Valid Parentheses problem solution in Java
- Leetcode Valid Parentheses problem solution in C
- Leetcode Valid Parentheses problem solution in C#