D55429.N-aryTreeLevelOrderTraversal题目链接429.N-aryTreeLevelOrderTraversal题目解析逐层遍历N元树.思路是以层数为key插入当前节点的值。可以递归遍历。最终代码$children函数__construct($val,$children){$this->val=$val;$this->children=$children;}}*/classSolution{/***@paramNode$root*@returnInteger[][]*/public$level=0;公共$values=[];functionlevelOrder($root){if(is_null($root)){return$this->values;}if(!isset($this->values[$this->level])){$this->values[$this->level]=[];$this->values[$this->level][]=$root->val;foreach($root->childrenas$child){$this->level++;$this->levelOrder($child);$这个->级别--;}返回$this->值；}}若觉得这篇文章对你有用，欢迎用爱发资源帮忙。
