Leetcode 559. Maximum Depth of N ary Tree | | Leetcode 559. Maximum Depth of N ary Tree 文章作者:Tyan博客:noahsnail.com | CSDN | 简书 1. Description 2. Solution12345678910111213141516171819202122232425262728293031323334/*// Definition for a Node.class Node {public: int val; vector<Node*> children; Node() {} Node(int _val, vector<Node*> _children) { val = _val; children = _children; }};*/class Solution {public: int maxDepth(Node* root) { if(!root) { return 0; } if(root->children.size() == 0) { return 1; } int max = 0; for(int i = 0; i < root->children.size(); i++) { int depth = maxDepth(root->children[i]); if(depth > max) { max = depth; } } return max + 1; }}; Reference https://leetcode.com/problems/maximum-depth-of-n-ary-tree/description/ 如果有收获,可以请我喝杯咖啡! 赏 微信打赏 支付宝打赏