1614. Maximum Nesting Depth of the Parentheses

这道题就是921的变种，话不多说：

    public int maxDepth(String s) {
        int count = 0;
        int max = 0;
        for (char c : s.toCharArray()) {
            if (c == '(') {
                count++;
                max = Math.max(max, count);
            } else if (c == ')') {
                count--;
            }
        }
        return max;
    }

标签：count,Parentheses,String,int,max,1614,char,Depth,Math
来源： https://www.cnblogs.com/feiflytech/p/15860019.html