update/0515: add other solution

novahe · novahe · commit 2608238acbff · 2021-11-05T19:45:18.000+08:00
diff --git a/leetcode/0515.Find-Largest-Value-in-Each-Tree-Row/515. Find Largest Value in Each Tree Row.go b/leetcode/0515.Find-Largest-Value-in-Each-Tree-Row/515. Find Largest Value in Each Tree Row.go
@@ -92,3 +92,25 @@ func largestValues1(root *TreeNode) []int {
 	}
 	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
+}
diff --git a/website/content/ChapterFour/0500~0599/0515.Find-Largest-Value-in-Each-Tree-Row.md b/website/content/ChapterFour/0500~0599/0515.Find-Largest-Value-in-Each-Tree-Row.md
@@ -90,6 +90,28 @@ func largestValues1(root *TreeNode) []int {
 	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
+}
+
 ```
 
 
