• Skip to primary navigation
  • Skip to content
  • Skip to footer
zhicheng xie's demo blog
  • Quick-Start Guide

    Your Name

    I am an amazing person.

    • Somewhere

    Maximum Nesting Depth of the Parentheses

    less than 1 minute read

    <-E 1614> Maximum Nesting Depth of the Parentheses

    class Solution {
    public:
        int maxDepth(string s) {
            int ans = 0;
            int check = 0;
            for(auto i : s) {
                if(i == '(') {
                    check++;
                }
                    
                if(i == ')') {
                    check--;
                }
                if(check > ans) {
                    ans = check;
                }
            }
            return ans;
        }
    };
    

    Tags: Algorithms, C++, Leetcode

    Updated: November 22, 2020

    Share on

    Twitter Facebook LinkedIn
    Previous Next

    You may also enjoy

    Decode Ways

    less than 1 minute read

    <-M 91> Decode Ways

    Word Break

    less than 1 minute read

    <-H 139> Word Break

    Distinct Subsequences

    less than 1 minute read

    <-H 115> Distinct Subsequences

    Edit Distance

    less than 1 minute read

    <-H 72> Edit Distance

    • Follow:
    • Feed
    © 2023 zhicheng xie's blog. Powered by Jekyll & Minimal Mistakes.