algorithm/LeetCode-Go
1
0
Fork 0
mirror of https://github.com/halfrost/LeetCode-Go.git synced 2025-07-07 09:54:57 +08:00
Code Issues Packages Projects Releases Wiki Activity

update/0515: add other solution

Browse Source
This commit is contained in:
novahe
2021-11-05 19:42:56 +08:00
parent d1a87f1cbf
commit 2608238acb
2 changed files with 44 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

22
leetcode/0515.Find-Largest-Value-in-Each-Tree-Row/515. Find Largest Value in Each Tree Row.go
View File

@ -92,3 +92,25 @@ func largestValues1(root *TreeNode) []int {
} }
return res return res
} }
// 解法三 深度遍历二叉树
func largestValues3(root *TreeNode) []int {
var res []int
var dfs func(root *TreeNode, level int)
dfs = func(root *TreeNode, level int) {
if root == nil {
return
}
if len(res) == level {
res = append(res, root.Val)
}
if res[level] < root.Val {
res[level] = root.Val
}
dfs(root.Right, level+1)
dfs(root.Left, level+1)
}
dfs(root, 0)
return res
}

22
website/content/ChapterFour/0500~0599/0515.Find-Largest-Value-in-Each-Tree-Row.md
View File

@ -90,6 +90,28 @@ func largestValues1(root *TreeNode) []int {
return res return res
} }
// 解法三 深度遍历二叉树
func largestValues3(root *TreeNode) []int {
var res []int
var dfs func(root *TreeNode, level int)
dfs = func(root *TreeNode, level int) {
if root == nil {
return
}
if len(res) == level {
res = append(res, root.Val)
}
if res[level] < root.Val {
res[level] = root.Val
}
dfs(root.Right, level+1)
dfs(root.Left, level+1)
}
dfs(root, 0)
return res
}
``` ```