java.lang.Object
g1601_1700.s1614_maximum_nesting_depth_of_the_parentheses.Solution

public class Solution extends Object
1614 - Maximum Nesting Depth of the Parentheses.<p>Easy</p> <p>A string is a <strong>valid parentheses string</strong> (denoted <strong>VPS</strong> ) if it meets one of the following:</p> <ul> <li>It is an empty string <code>&quot;&quot;</code>, or a single character not equal to <code>&quot;(&quot;</code> or <code>&quot;)&quot;</code>,</li> <li>It can be written as <code>AB</code> (<code>A</code> concatenated with <code>B</code>), where <code>A</code> and <code>B</code> are <strong>VPS</strong>&rsquo;s, or</li> <li>It can be written as <code>(A)</code>, where <code>A</code> is a <strong>VPS</strong>.</li> </ul> <p>We can similarly define the <strong>nesting depth</strong> <code>depth(S)</code> of any VPS <code>S</code> as follows:</p> <ul> <li><code>depth(&quot;&quot;) = 0</code></li> <li><code>depth(C) = 0</code>, where <code>C</code> is a string with a single character not equal to <code>&quot;(&quot;</code> or <code>&quot;)&quot;</code>.</li> <li><code>depth(A + B) = max(depth(A), depth(B))</code>, where <code>A</code> and <code>B</code> are <strong>VPS</strong>&rsquo;s.</li> <li><code>depth(&quot;(&quot; + A + &quot;)&quot;) = 1 + depth(A)</code>, where <code>A</code> is a <strong>VPS</strong>.</li> </ul> <p>For example, <code>&quot;&quot;</code>, <code>&quot;()()&quot;</code>, and <code>&quot;()(()())&quot;</code> are <strong>VPS</strong>&rsquo;s (with nesting depths 0, 1, and 2), and <code>&quot;)(&quot;</code> and <code>&quot;(()&quot;</code> are not <strong>VPS</strong>&rsquo;s.</p> <p>Given a <strong>VPS</strong> represented as string <code>s</code>, return <em>the <strong>nesting depth</strong> of</em> <code>s</code>.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> s = &ldquo;(1+(2*3)+((8)/4))+1&rdquo;</p> <p><strong>Output:</strong> 3</p> <p><strong>Explanation:</strong> Digit 8 is inside of 3 nested parentheses in the string.</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> s = &ldquo;(1)+((2))+(((3)))&rdquo;</p> <p><strong>Output:</strong> 3</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= s.length <= 100</code></li> <li><code>s</code> consists of digits <code>0-9</code> and characters <code>'+'</code>, <code>'-'</code>, <code>'*'</code>, <code>'/'</code>, <code>'('</code>, and <code>')'</code>.</li> <li>It is guaranteed that parentheses expression <code>s</code> is a <strong>VPS</strong>.</li> </ul>
  • Constructor Details

    • Solution

      public Solution()
  • Method Details

    • maxDepth

      public int maxDepth(String s)