654 accepted. 112ms > 106ms

Author: aQua

Algorithms/0654.maximum-binary-tree/README.md

@@ -19,8 +19,8 @@ Output: return the tree root node representing the following tree:
       6
     /   \
    3     5
-    \    / 
-     2  0   
+    \    /
+     2  0
        \
         1
 ```

Algorithms/0654.maximum-binary-tree/maximum-binary-tree.go

@@ -7,6 +7,31 @@ import (
 type TreeNode = kit.TreeNode
 
 func constructMaximumBinaryTree(nums []int) *TreeNode {
+	if len(nums) == 0 {
+		return nil
+	}
 
-	return nil
+	if len(nums) == 1 {
+		return &TreeNode{Val: nums[0]}
+	}
+
+	v, i := getMax(nums)
+
+	return &TreeNode{
+		Val:   v,
+		Left:  constructMaximumBinaryTree(nums[:i]),
+		Right: constructMaximumBinaryTree(nums[i+1:]),
+	}
+}
+
+func getMax(nums []int) (val, index int) {
+	val = nums[0]
+	index = 0
+	for i := 1; i < len(nums); i++ {
+		if val < nums[i] {
+			val = nums[i]
+			index = i
+		}
+	}
+	return val, index
 }

Algorithms/0654.maximum-binary-tree/maximum-binary-tree_test.go

@@ -15,7 +15,12 @@ var tcs = []struct {
 	post []int
 }{
 
-// 可以有多个 testcase
+	{
+		[]int{3, 2, 1, 6, 0, 5},
+		[]int{1, 2, 3, 0, 5, 6},
+	},
+
+	// 可以有多个 testcase
 }
 
 func Test_fn(t *testing.T) {