improved 515 solution

Author: SHA65536

problems/problem0515/largest_node_level.go

@@ -32,3 +32,34 @@ func largestValues(root *TreeNode) []int {
 	}
 	return res
 }
+
+func largestValuesRec(root *TreeNode) []int {
+	var res []int
+	var solve func(*TreeNode, int)
+
+	if root == nil {
+		return nil
+	}
+
+	solve = func(tn *TreeNode, i int) {
+		if i >= len(res) {
+			res = append(res, tn.Val)
+		} else {
+			if res[i] < tn.Val {
+				res[i] = tn.Val
+			}
+		}
+
+		if tn.Left != nil {
+			solve(tn.Left, i+1)
+		}
+
+		if tn.Right != nil {
+			solve(tn.Right, i+1)
+		}
+	}
+
+	solve(root, 0)
+
+	return res
+}

problems/problem0515/largest_node_level_test.go

@@ -27,3 +27,29 @@ func TestLargestNodeLevel(t *testing.T) {
 		assert.Equal(want, got, fmt.Sprintf("%+v", res))
 	}
 }
+
+func BenchmarkLargestNodeLevel(b *testing.B) {
+	for i := 0; i < b.N; i++ {
+		for _, res := range Results {
+			largestValues(res.Input)
+		}
+	}
+}
+
+func TestLargestNodeLevelRec(t *testing.T) {
+	assert := assert.New(t)
+
+	for _, res := range Results {
+		want := res.Expected
+		got := largestValuesRec(res.Input)
+		assert.Equal(want, got, fmt.Sprintf("%+v", res))
+	}
+}
+
+func BenchmarkLargestNodeLevelRec(b *testing.B) {
+	for i := 0; i < b.N; i++ {
+		for _, res := range Results {
+			largestValuesRec(res.Input)
+		}
+	}
+}