572 added

Author: aQua

Algorithms/0572.subtree-of-another-tree/README.md

@@ -0,0 +1,47 @@
+# [572. Subtree of Another Tree](https://leetcode.com/problems/subtree-of-another-tree/)
+
+## 题目
+
+Given two non-empty binary trees s and t, check whether tree t has exactly the same structure and node values with a subtree of s. A subtree of s is a tree consists of a node in s and all of this node's descendants. The tree s could also be considered as a subtree of itself.
+
+Example 1:
+
+```text
+Given tree s:
+     3
+    / \
+   4   5
+  / \
+ 1   2
+
+Given tree t:
+   4
+  / \
+ 1   2
+
+Return true, because t has the same structure and node values with a subtree of s.
+```
+
+Example 2:
+
+```text
+Given tree s:
+     3
+    / \
+   4   5
+  / \
+ 1   2
+    /
+   0
+
+Given tree t:
+   4
+  / \
+ 1   2
+
+Return false.
+```
+
+## 解题思路
+
+见程序注释

Algorithms/0572.subtree-of-another-tree/subtree-of-another-tree.go

@@ -0,0 +1,13 @@
+package Problem0572
+
+import (
+	"github.com/aQuaYi/LeetCode-in-Go/kit"
+)
+
+type TreeNode = kit.TreeNode
+
+func isSubtree(s *TreeNode, t *TreeNode) bool {
+	res := false
+
+	return res
+}

Algorithms/0572.subtree-of-another-tree/subtree-of-another-tree_test.go

@@ -0,0 +1,57 @@
+package Problem0572
+
+import (
+	"fmt"
+	"testing"
+
+	"github.com/aQuaYi/LeetCode-in-Go/kit"
+
+	"github.com/stretchr/testify/assert"
+)
+
+// tcs is testcase slice
+var tcs = []struct {
+	spre, sin []int
+	tpre, tin []int
+	ans       bool
+}{
+
+	{
+		[]int{3, 4, 1, 2, 0, 5},
+		[]int{1, 4, 0, 2, 3, 5},
+		[]int{4, 1, 2},
+		[]int{1, 4, 2},
+		false,
+	},
+
+	{
+		[]int{3, 4, 1, 2, 5},
+		[]int{1, 4, 2, 3, 5},
+		[]int{4, 1, 2},
+		[]int{1, 4, 2},
+		true,
+	},
+
+	// 可以有多个 testcase
+}
+
+func Test_isSubtree(t *testing.T) {
+	ast := assert.New(t)
+
+	for _, tc := range tcs {
+		fmt.Printf("~~%v~~\n", tc)
+		s := kit.PreIn2Tree(tc.spre, tc.sin)
+		t := kit.PreIn2Tree(tc.tpre, tc.tin)
+		ast.Equal(tc.ans, isSubtree(s, t), "输入:%v", tc)
+	}
+}
+
+func Benchmark_isSubtree(b *testing.B) {
+	for i := 0; i < b.N; i++ {
+		for _, tc := range tcs {
+			s := kit.PreIn2Tree(tc.spre, tc.sin)
+			t := kit.PreIn2Tree(tc.tpre, tc.tin)
+			isSubtree(s, t)
+		}
+	}
+}