规范格式

leetcode/0104.Maximum-Depth-of-Binary-Tree/104. Maximum Depth of Binary Tree.go

@@ -0,0 +1,31 @@
+package leetcode
+
+import (
+	"github.com/halfrost/LeetCode-Go/structures"
+)
+
+// TreeNode define
+type TreeNode = structures.TreeNode
+
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ *     Val int
+ *     Left *TreeNode
+ *     Right *TreeNode
+ * }
+ */
+
+func maxDepth(root *TreeNode) int {
+	if root == nil {
+		return 0
+	}
+	return max(maxDepth(root.Left), maxDepth(root.Right)) + 1
+}
+
+func max(a int, b int) int {
+	if a > b {
+		return a
+	}
+	return b
+}

leetcode/0104.Maximum-Depth-of-Binary-Tree/104. Maximum Depth of Binary Tree_test.go

@@ -0,0 +1,51 @@
+package leetcode
+
+import (
+	"fmt"
+	"testing"
+
+	"github.com/halfrost/LeetCode-Go/structures"
+)
+
+type question104 struct {
+	para104
+	ans104
+}
+
+// para 是参数
+// one 代表第一个参数
+type para104 struct {
+	one []int
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans104 struct {
+	one int
+}
+
+func Test_Problem104(t *testing.T) {
+
+	qs := []question104{
+
+		question104{
+			para104{[]int{}},
+			ans104{0},
+		},
+
+		question104{
+			para104{[]int{3, 9, 20, structures.NULL, structures.NULL, 15, 7}},
+			ans104{3},
+		},
+	}
+
+	fmt.Printf("------------------------Leetcode Problem 104------------------------\n")
+
+	for _, q := range qs {
+		_, p := q.ans104, q.para104
+		fmt.Printf("【input】:%v      ", p)
+		root := structures.Ints2TreeNode(p.one)
+		fmt.Printf("【output】:%v      \n", maxDepth(root))
+	}
+	fmt.Printf("\n\n\n")
+}

leetcode/0104.Maximum-Depth-of-Binary-Tree/README.md

@@ -0,0 +1,34 @@
+# [104. Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree/)
+
+## 题目
+
+Given a binary tree, find its maximum depth.
+
+The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.
+
+Note: A leaf is a node with no children.
+
+Example:
+
+Given binary tree [3,9,20,null,null,15,7],
+
+```c
+    3
+   / \
+  9  20
+    /  \
+   15   7
+```
+
+return its depth = 3.
+ 
+
+## 题目大意
+
+要求输出一棵树的最大高度。
+
+## 解题思路
+
+这一题递归遍历就可，遍历根节点的左孩子的高度和根节点右孩子的高度，取出两者的最大值再加一即为总高度。
+
+