Calculating Nesting Depth Of Parentheses In VPS Strings
Maximum nesting depth of parentheses can be calculated by iterating through the string and keeping track of opened parentheses with a counter. The maximum value of this counter is the result.
1614. Maximum Nesting Depth of the Parentheses
Easy
A string is a valid parentheses string (denoted VPS) if it meets one of the following:
It is an empty string "", or a single character not equal to "(" or ")",
It can be written as AB (A concatenated with B), where A and B are VPS's, or
It can be written as (A), where A is a VPS.
We can similarly define the nesting depth depth(S) of any VPS S as follows:
depth("") = 0
depth(C) = 0, where C is a string with a single character not equal to "(" or ")".
depth(A + B) = max(depth(A), depth(B)), where A and B are VPS's.
depth("(" + A + ")") = 1 +...