feat: finish 1008

Author: plh97

.vscode/launch.json

@@ -4,21 +4,34 @@
   // For more information, visit: https://go.microsoft.com/fwlink/?linkid=830387
   "version": "0.2.0",
   "configurations": [
-  {
-    "type": "node",
-    "request": "launch",
-    "name": "node",
-    "runtimeExecutable": "node",
-    "program": "${fileDirname}/index.js",
-    "restart": true,
-    "console": "integratedTerminal",
-    "internalConsoleOptions": "neverOpen"
-  },
-  {
-    "name": "leetcode",
-    "type": "go",
-    "request": "launch",
-    "mode": "test",
-    "program": "${fileDirname}"
-  }]
+    {
+      "type": "java",
+      "name": "CodeLens (Launch) - Example",
+      "request": "launch",
+      "mainClass": "Example"
+    },
+    {
+      "type": "java",
+      "name": "CodeLens (Launch) - sort",
+      "request": "launch",
+      "mainClass": "sort"
+    },
+    {
+      "type": "node",
+      "request": "launch",
+      "name": "node",
+      "runtimeExecutable": "node",
+      "program": "${fileDirname}/index.js",
+      "restart": true,
+      "console": "integratedTerminal",
+      "internalConsoleOptions": "neverOpen"
+    },
+    {
+      "name": "leetcode",
+      "type": "go",
+      "request": "launch",
+      "mode": "test",
+      "program": "${fileDirname}"
+    }
+  ]
 }

.vscode/settings.json

@@ -1,3 +1,4 @@
 {
-  "python.linting.enabled": true
+  "python.linting.enabled": true,
+  "java.format.settings.profile": "GoogleStyle",
 }

algorithm/1008.ConstructBinarySearchTreefromPreorderTraversal/README.md

@@ -0,0 +1,21 @@
+# [1008. Construct Binary Search Tree from Preorder Traversal](https://leetcode.com/problems/construct-binary-search-tree-from-preorder-traversal/)
+
+## 2019/08/31
+
+### 题目 💗[medium]
+
+Return the root node of a binary search tree that matches the given preorder traversal.
+
+(Recall that a binary search tree is a binary tree where for every node, any descendant of node.left has a value < node.val, and any descendant of node.right has a value > node.val. Also recall that a preorder traversal displays the value of the node first, then traverses node.left, then traverses node.right.)
+
+Example 1:
+
+```bash
+Input: [8,5,1,7,10,12]
+Output: [8,5,10,1,7,null,12]
+```
+
+Note:
+
+- 1 <= preorder.length <= 100
+- The values of preorder are distinct.

algorithm/1008.ConstructBinarySearchTreefromPreorderTraversal/main.go

@@ -0,0 +1,44 @@
+package bstFromPreorder
+
+import "github.com/pengliheng/leetcode/Helper"
+
+type TreeNode = Helper.TreeNode
+
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ *     Val int
+ *     Left *TreeNode
+ *     Right *TreeNode
+ * }
+ */
+func bstFromPreorder(preorder []int) *TreeNode {
+	if len(preorder) == 0 {
+		return nil
+	}
+	root := &TreeNode{Val: preorder[0]}
+	for i, e := range preorder {
+		if i == 0 {
+			continue
+		}
+		current := root
+		for {
+			if current.Val > e {
+				if current.Left == nil {
+					current.Left = &TreeNode{Val: e}
+					break
+				} else {
+					current = current.Left
+				}
+			} else {
+				if current.Right == nil {
+					current.Right = &TreeNode{Val: e}
+					break
+				} else {
+					current = current.Right
+				}
+			}
+		}
+	}
+	return root
+}

algorithm/1008.ConstructBinarySearchTreefromPreorderTraversal/main_test.go

@@ -0,0 +1,26 @@
+package bstFromPreorder
+
+import (
+	"testing"
+
+	"github.com/pengliheng/leetcode/Helper"
+
+	"github.com/stretchr/testify/assert"
+)
+
+var tcs = []struct {
+	N1  []int
+	ans *TreeNode
+}{
+	{
+		[]int{8, 5, 1, 7, 10, 12},
+		Helper.Ints2TreeNode([]int{8, 5, 10, 1, 7, -1 << 63, 12}),
+	},
+}
+
+func Test_bitwiseComplement(t *testing.T) {
+	ast := assert.New(t)
+	for _, tc := range tcs {
+		ast.Equal(tc.ans, bstFromPreorder(tc.N1), "输入:%v", tc)
+	}
+}

DP/README.md algorithm/DP/README.md

@@ -0,0 +1,37 @@
+import edu.princeton.cs.algs4.StdIn;
+import edu.princeton.cs.algs4.StdOut;
+
+/**
+ * Example
+ */
+public class Example {
+  public static void sort(Comparable[] a) {
+
+  }
+
+  public static boolean less(Comparable a, Comparable b) {
+    return a.compareTo(b) < 0;
+  }
+
+  public static void show(Comparable[] a) {
+    for (int i = 0; i < a.length; i++) {
+      StdOut.print(a[i] + " ");
+    }
+    StdOut.println();
+  }
+
+  public static boolean isSorted(Comparable[] a) {
+    for (int i = 0; i < a.length; i++) {
+      if (less(a[i], a[i + 1]))
+        return false;
+    }
+    return true;
+  }
+
+  public static void main(String[] args) {
+    String[] a = In.readStrings();
+    sort(a);
+    assert isSorted(a);
+    show(a);
+  }
+}

DP/cutRod/main.go algorithm/DP/cutRod/main.go

@@ -0,0 +1 @@
+# 第二章 排序

DP/cutRod/main_test.go algorithm/DP/cutRod/main_test.go

@@ -0,0 +1,3 @@
+(defvar *name* "hello-word")
+
+(format )

DP/fibonacci/README.md algorithm/DP/fibonacci/README.md

@@ -0,0 +1 @@
+S O R T E X A M P L E