Tags

  • AWS (7)
  • Apigee (3)
  • ArchLinux (5)
  • Array (6)
  • Backtracking (6)
  • BinarySearch (6)
  • C++ (19)
  • CI&CD (3)
  • Calculus (2)
  • DesignPattern (43)
  • DisasterRecovery (1)
  • Docker (8)
  • DynamicProgramming (20)
  • FileSystem (11)
  • Frontend (2)
  • FunctionalProgramming (1)
  • GCP (1)
  • Gentoo (6)
  • Git (16)
  • Golang (1)
  • Graph (10)
  • GraphQL (1)
  • Hardware (1)
  • Hash (1)
  • Kafka (1)
  • LinkedList (13)
  • Linux (27)
  • Lodash (2)
  • MacOS (3)
  • Makefile (1)
  • Map (5)
  • MathHistory (1)
  • MySQL (21)
  • Neovim (11)
  • Network (67)
  • Nginx (6)
  • Node.js (33)
  • OpenGL (6)
  • PriorityQueue (1)
  • ProgrammingLanguage (9)
  • Python (10)
  • RealAnalysis (20)
  • Recursion (3)
  • Redis (1)
  • RegularExpression (1)
  • Ruby (19)
  • SQLite (1)
  • Sentry (3)
  • Set (4)
  • Shell (4)
  • SoftwareEngineering (12)
  • Sorting (2)
  • Stack (4)
  • String (2)
  • SystemDesign (13)
  • Terraform (2)
  • Tree (24)
  • Trie (2)
  • TwoPointers (16)
  • TypeScript (3)
  • Ubuntu (4)
  • Home

    [LeetCode 20] Valid Parentheses

    Published Nov 30, 2021 [  Stack  ]

    Problem

    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.

    Example 1:

    Input: s = "()"
    Output: true
    

    Example 2:

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

    Example 3:

    Input: s = "(]"
    Output: false
    

    Example 4:

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

    Example 5:

    Input: s = "{[]}"
    Output: true
    

    Constraints:

    - 1 <= s.length <= 104
    - s consists of parentheses only '()[]{}'.
    

    Typescript

    function isValid(s: string): boolean {
        if(s.length % 2 === 1) return false;
    
        const stack = []
        const leftBrackets = ['(', '[', '{']
    
        for(let p of s) {
            // push to stack if it is left brackets
            if(leftBrackets.includes(p)) {
                stack.push(p)
            } else {
                // pop if it is right brackets and do order check
                const current = stack.pop()
                if(!(
                    (p === ')' && current === '(') ||
                    (p === ']' && current === '[' ) ||
                    (p === '}' && current === '{')
                )
                ){
                    return false;
                }
            }
        }
    
        // there maybe only left brackets
        return stack.length === 0;
    };
    

    Reference