Skip to content

Latest commit

 

History

History
63 lines (53 loc) · 1.38 KB

20-valid-parentheses.md

File metadata and controls

63 lines (53 loc) · 1.38 KB

Valid Parentheses

URL: https://leetcode.com/problems/valid-parentheses/description/

Description:

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

Example 4:

Input: s = "([])"
Output: true

Constraints:

1 <= s.length <= 10^4
s consists of parentheses only '()[]{}'.

Solution Code:

class Solution:
    def isValid(self, s: str) -> bool:
        if len(s) < 2:
            return False

        open = ['(','{','[']
        stack = []
        for braket in s:
            if braket in open:
                stack.append(braket)
            else:
                if len(stack) == 0:
                    return False
                popped = stack.pop()
                if (braket == ')' and popped != '(') or (braket == '}' and popped != '{') or (braket == ']' and popped != '['):
                    return False
        return (len(stack) == 0)