[LeetCode]#1614. Maximum Nesting Depth of the Parentheses

Input: s = "(1+(2*3)+((8)/4))+1"
Output: 3
Explanation: Digit 8 is inside of 3 nested parentheses in the string.

Analysis:

class Solution:
def maxDepth(self, s):
ans=0
tmp=0
for i in s:
if (i=='('):
tmp+=1
ans=max(ans,tmp)
elif(i==')'):
tmp-=1
ans=max(ans,tmp)
return ans

--

--

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store