algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-09 03:34:02 +08:00
Code Issues Packages Projects Releases Wiki Activity

优化二叉树层序遍历116和117题的go方法

Browse Source
This commit is contained in:
marspere
2022-08-19 10:50:33 +08:00
parent b7e4c6901f
commit 10734b6f20
1 changed files with 33 additions and 36 deletions
Download Patch File Download Diff File Expand all files Collapse all files

29
problems/0102.二叉树的层序遍历.md
View File

@ -1891,13 +1891,12 @@ go:
*/
func connect(root *Node) *Node {
res:=[][]*Node{}
if root == nil { //防止为空
return root
}
queue := list.New()
queue.PushBack(root)
var tmpArr []*Node
tmpArr := make([]*Node, 0)
for queue.Len() > 0 {
length := queue.Len() //保存当前层的长度，然后处理当前层（十分重要，防止添加下层元素影响判断层中元素的个数）
for i := 0; i < length; i++ {
@ -1910,17 +1909,17 @@ func connect(root *Node) *Node {
}
tmpArr = append(tmpArr, node) //将值加入本层切片中
}
res=append(res,tmpArr)//放入结果集
tmpArr=[]*Node{}//清空层的数据
}
if len(tmpArr) > 1 {
// 遍历每层元素,指定next
for i:=0;i<len(res);i++{
for j:=0;j<len(res[i])-1;j++{
res[i][j].Next=res[i][j+1]
for i := 0; i < len(tmpArr)-1; i++ {
tmpArr[i].Next = tmpArr[i+1]
}
}
tmpArr = []*Node{} //清空层的数据
}
return root
}
```
Swift：
@ -2172,13 +2171,12 @@ go:
*/
func connect(root *Node) *Node {
res:=[][]*Node{}
if root == nil { //防止为空
return root
}
queue := list.New()
queue.PushBack(root)
var tmpArr []*Node
tmpArr := make([]*Node, 0)
for queue.Len() > 0 {
length := queue.Len() //保存当前层的长度，然后处理当前层（十分重要，防止添加下层元素影响判断层中元素的个数）
for i := 0; i < length; i++ {
@ -2191,15 +2189,14 @@ func connect(root *Node) *Node {
}
tmpArr = append(tmpArr, node) //将值加入本层切片中
}
res=append(res,tmpArr)//放入结果集
tmpArr=[]*Node{}//清空层的数据
}
if len(tmpArr) > 1 {
// 遍历每层元素,指定next
for i:=0;i<len(res);i++{
for j:=0;j<len(res[i])-1;j++{
res[i][j].Next=res[i][j+1]
for i := 0; i < len(tmpArr)-1; i++ {
tmpArr[i].Next = tmpArr[i+1]
}
}
tmpArr = []*Node{} //清空层的数据
}
return root
}
```