【2022初春】【LeetCode】【树】559. N 叉树的最大深度

看来这个Sysytem.out很占时间

/*
// Definition for a Node.
class Node {
    public int val;
    public List<Node> children;

    public Node() {}

    public Node(int _val) {
        val = _val;
    }

    public Node(int _val, List<Node> _children) {
        val = _val;
        children = _children;
    }
};
*/

class Solution {
    int res = 0;
    public int maxDepth(Node root) {
        if(root==null) return res;
        dfs(root);
        return res;
    }
    int dfs(Node root){
        if(root==null) return 0;
        int ans = 0;
        for(Node n : root.children){
            ans = Math.max(ans,dfs(n));
        }
        ans++;
        //System.out.println(ans);
        res = Math.max(res,ans);
        return ans;
    }
}