Add solution and test-cases for problem 108

Author: Cori1109

leetcode/101-200/0108.Convert-Sorted-Array-to-Binary-Search-Tree/Solution.go

@@ -1,5 +1,19 @@
 package Solution
 
-func Solution(x bool) bool {
-	return x
+func Solution(nums []int) *TreeNode {
+	if len(nums) == 0 {
+		return nil
+	}
+
+	node := &TreeNode{}
+	mid := len(nums) / 2
+	node.Val = nums[mid]
+	if mid > 0 {
+		node.Left = Solution(nums[:mid])
+	}
+	if mid < len(nums)-1 {
+		node.Right = Solution(nums[mid+1:])
+	}
+
+	return node
 }

leetcode/101-200/0108.Convert-Sorted-Array-to-Binary-Search-Tree/Solution_test.go

@@ -10,12 +10,22 @@ func TestSolution(t *testing.T) {
 	//	测试用例
 	cases := []struct {
 		name   string
-		inputs bool
-		expect bool
+		inputs []int
+		expect *TreeNode
 	}{
-		{"TestCase", true, true},
-		{"TestCase", true, true},
-		{"TestCase", false, false},
+		{"TestCase1", []int{-10, -3, 0, 5, 9}, &TreeNode{
+			Val: 0,
+			Left: &TreeNode{
+				Val:  -3,
+				Left: &TreeNode{Val: -10},
+			},
+			Right: &TreeNode{
+				Val:  9,
+				Left: &TreeNode{Val: 5},
+			},
+		}},
+		{"TestCase2", []int{1, 3}, &TreeNode{Val: 3, Left: &TreeNode{Val: 1}, Right: nil}},
+		{"TestCase3", []int{1}, &TreeNode{Val: 1}},
 	}
 
 	//	开始测试

leetcode/101-200/0108.Convert-Sorted-Array-to-Binary-Search-Tree/type.go

@@ -0,0 +1,7 @@
+package Solution
+
+type TreeNode struct {
+	Val   int
+	Left  *TreeNode
+	Right *TreeNode
+}