Leetcode 1614. Maximum Nesting Depth of the Parentheses

참고: leetcode r0bertz

class Solution:
    def maxDepth(self, s: str) -> int:
        ans=cnt=0
        for i in s:
            if i =="(" : 
                cnt+=1
                ans=max(ans,cnt)
            elif i==")" : cnt-=1
        return ans