2022.1.7-----leetcode.1614

 public int maxDepth(String s) {
        int ans = 0, size = 0;
        //遍历
        for (int i = 0; i < s.length(); ++i) 
        {
            char ch = s.charAt(i);
            //ans记录历史最大深度，size记录当前深度
            if (ch == '(') 
            {
                ++size;
                ans = Math.max(ans, size);
            }
            //遇到成对括号，size-1
            else if (ch == ')') 
            {
                --size;
            }
        }
        return ans;
    }