515 added

Author: aQua

Algorithms/0515.find-largest-value-in-each-tree-row/README.md

@@ -0,0 +1,23 @@
+# [515. Find Largest Value in Each Tree Row](https://leetcode.com/problems/find-largest-value-in-each-tree-row/)
+
+## 题目
+
+You need to find the largest value in each row of a binary tree.
+
+Example:
+
+```text
+Input:
+
+          1
+         / \
+        3   2
+       / \   \
+      5   3   9
+
+Output: [1, 3, 9]
+```
+
+## 解题思路
+
+见程序注释

Algorithms/0515.find-largest-value-in-each-tree-row/find-largest-value-in-each-tree-row.go

@@ -0,0 +1,13 @@
+package Problem0515
+
+import (
+	"github.com/aQuaYi/LeetCode-in-Go/kit"
+)
+
+type TreeNode = kit.TreeNode
+
+func largestValues(root *TreeNode) []int {
+	res := []int{1, 3, 9}
+
+	return res
+}

Algorithms/0515.find-largest-value-in-each-tree-row/find-largest-value-in-each-tree-row_test.go

@@ -0,0 +1,44 @@
+package Problem0515
+
+import (
+	"fmt"
+	"testing"
+
+	"github.com/aQuaYi/LeetCode-in-Go/kit"
+
+	"github.com/stretchr/testify/assert"
+)
+
+// tcs is testcase slice
+var tcs = []struct {
+	pre, in []int
+	ans     []int
+}{
+
+	{
+		[]int{1, 3, 5, 6, 2, 9},
+		[]int{5, 3, 6, 1, 2, 9},
+		[]int{1, 3, 9},
+	},
+
+	// 可以有多个 testcase
+}
+
+func Test_largestValues(t *testing.T) {
+	ast := assert.New(t)
+
+	for _, tc := range tcs {
+		fmt.Printf("~~%v~~\n", tc)
+		root := kit.PreIn2Tree(tc.pre, tc.in)
+		ast.Equal(tc.ans, largestValues(root), "输入:%v", tc)
+	}
+}
+
+func Benchmark_largestValues(b *testing.B) {
+	for i := 0; i < b.N; i++ {
+		for _, tc := range tcs {
+			root := kit.PreIn2Tree(tc.pre, tc.in)
+			largestValues(root)
+		}
+	}
+}