Merge pull request #99 from kylesliu/develop

add 111 problem solution

Author: 6boris

src/0111.Minimum-Depth-of-Binary-Tree/README.md

@@ -0,0 +1,48 @@
+# [112. Path Sum][title]
+
+## Description
+
+Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.
+
+Note: A leaf is a node with no children.
+
+**Example 1:**
+Given the below binary tree and sum = 22,
+
+```
+ 5
+ / \
+ 4 8
+ / / \
+ 11 13 4
+ / \ \
+7 2 1
+```
+
+
+**Tags:** Math, String
+
+## 题意
+> 求2数之和
+
+## 题解
+
+### 思路1
+> 。。。。
+
+```go
+
+```
+
+### 思路2
+> 思路2
+```go
+
+```
+
+## 结语
+
+如果你同我一样热爱数据结构、算法、LeetCode，可以关注我 GitHub 上的 LeetCode 题解：[awesome-golang-leetcode][me]
+
+[title]: https://leetcode.com/problems/two-sum/description/
+[me]: https://github.com/kylesliu/awesome-golang-leetcode

src/0111.Minimum-Depth-of-Binary-Tree/Solution.go

@@ -0,0 +1,30 @@
+package Solution
+
+type TreeNode struct {
+Val int
+Left *TreeNode
+Right *TreeNode
+}
+
+func minDepth(root *TreeNode) int {
+if root == nil {
+return 0
+}
+
+if root.Left == nil {
+return minDepth(root.Right) + 1
+}
+
+if root.Right == nil {
+return minDepth(root.Left) + 1
+}
+
+return min(minDepth(root.Left), minDepth(root.Right)) + 1
+}
+
+func min(x, y int) int {
+if x < y {
+return x
+}
+return y
+}

src/0111.Minimum-Depth-of-Binary-Tree/Solution_test.go

@@ -0,0 +1,47 @@
+package Solution
+
+import (
+"reflect"
+"strconv"
+"testing"
+)
+
+func TestSolution(t *testing.T) {
+//	测试用例
+cases := []struct {
+name string
+inputs *TreeNode
+expect int
+}{
+{"TestCase",
+&TreeNode{Val: 3,
+Left: &TreeNode{Val: 9, Left: nil, Right: nil},
+Right: &TreeNode{Val: 20,
+Left: &TreeNode{Val: 15, Left: nil, Right: nil},
+Right: &TreeNode{Val: 7, Left: nil, Right: nil},
+},
+},
+2},
+}
+
+//	开始测试
+for i, c := range cases {
+t.Run(c.name+" "+strconv.Itoa(i), func(t *testing.T) {
+got := minDepth(c.inputs)
+if !reflect.DeepEqual(got, c.expect) {
+t.Fatalf("expected: %v, but got: %v, with inputs: %v",
+c.expect, got, c.inputs)
+}
+})
+}
+}
+
+//	压力测试
+func BenchmarkSolution(b *testing.B) {
+
+}
+
+//	使用案列
+func ExampleSolution() {
+
+}