[E:11/529, M:13/965, H:0/384] add No: 450 Delete Node in a BST

gladmo · gladmo · commit ebf05b0d481d · 2020-11-28T11:52:07.000+08:00
diff --git a/leet/golang.go b/leet/golang.go
@@ -85,16 +85,6 @@ func main() {
 			},
 			want: true,
 		},
-		{
-			name: "test-[[1,3],[3,0,1],[2],[0]]",
-			input: [][]int{
-				{1, 3},
-				{3, 0, 1},
-				{2},
-				{0},
-			},
-			want: false,
-		},
 	}
 
 	testLog := leet.NewTestLog(len(tests))
diff --git a/questions/serial/中等/450/golang/main.go b/questions/serial/中等/450/golang/main.go
@@ -0,0 +1,121 @@
+package main
+
+import (
+	"context"
+	"fmt"
+	"strings"
+	"time"
+
+	"github.com/gladmo/leetcode/leet"
+	"github.com/gladmo/leetcode/questions/serial/中等/450/golang/solution"
+	"github.com/gladmo/leetcode/utils/tree"
+)
+
+func main() {
+	/*
+
+			[5,3,6,2,4,null,7]
+		3
+
+	*/
+
+	tests := []struct {
+		name   string
+		input1 *solution.TreeNode
+		input2 int
+		want   []string
+	}{
+		{
+			name:   "test-[5,2,6,1,4,null,7,null,null,3]",
+			input1: tree.CreateTree("[5,2,6,1,4,null,7,null,null,3]"),
+			input2: 5,
+			want: []string{
+				"[6,3,7,2,4]",
+				"[6,2,7,1,4,null,null,null,null,3]",
+			},
+		},
+		{
+			name:   "test-[5,2,6,1,4,null,7,null,null,3]",
+			input1: tree.CreateTree("[5,2,6,1,4,null,7,null,null,3]"),
+			input2: 7,
+			want: []string{
+				"[5,2,6,1,4,null,null,null,null,3]",
+			},
+		},
+		{
+			name:   "test-[5,2,6,1,4,null,7,null,null,3]",
+			input1: tree.CreateTree("[5,2,6,1,4,null,7,null,null,3]"),
+			input2: 6,
+			want: []string{
+				"[5,2,7,1,4,null,null,null,null,3]",
+			},
+		},
+		{
+			name:   "test-[5,2,6,1,4,null,7,null,null,3]",
+			input1: tree.CreateTree("[5,2,6,1,4,null,7,null,null,3]"),
+			input2: 2,
+			want: []string{
+				"[5,3,6,1,4,null,7]",
+			},
+		},
+		{
+			name:   "test-[5,3,6,2,4,null,7]",
+			input1: tree.CreateTree("[5,3,6,2,4,null,7]"),
+			input2: 3,
+			want: []string{
+				"[5,4,6,2,null,null,7]",
+				"[5,2,6,null,4,null,7]",
+			},
+		},
+		{
+			name:   "test-[5,3,6,2,4,null,7]",
+			input1: tree.CreateTree("[5,3,6,2,4,null,7]"),
+			input2: 0,
+			want: []string{
+				"[5,3,6,2,4,null,7]",
+			},
+		},
+		{
+			name:   "test-[0]",
+			input1: tree.CreateTree("[0]"),
+			input2: 0,
+			want: []string{
+				"[]",
+			},
+		},
+		{
+			name:   "test-[]",
+			input1: tree.CreateTree("[]"),
+			input2: 0,
+			want: []string{
+				"[]",
+			},
+		},
+	}
+
+	testLog := leet.NewTestLog(len(tests))
+	defer testLog.Render()
+
+	timeoutDuration := time.Second * 2
+
+	for idx, test := range tests {
+		// 超时检测
+		timeout := leet.Timeout(timeoutDuration, func(ctx context.Context, cancel context.CancelFunc) {
+
+			cancel()
+		})
+
+		if timeout {
+			testLog.Fail(idx+1, test.name, "timeout")
+			continue
+		}
+
+		got := solution.Export(test.input1, test.input2)
+		if !strings.Contains(strings.Join(test.want, ","), got.String()) {
+			testLog.Fail(idx+1, test.name, fmt.Sprintf("want: %v, got %v.", test.want, got))
+			continue
+		}
+
+		testLog.Pass(idx+1, test.name)
+	}
+}
diff --git a/questions/serial/中等/450/golang/solution/delete-node-in-a-bst.go b/questions/serial/中等/450/golang/solution/delete-node-in-a-bst.go
@@ -0,0 +1,30 @@
+package solution
+
+// type TreeNode struct {
+// 	Val   int
+// 	Left  *TreeNode
+// 	Right *TreeNode
+// }
+
+type TreeNode = tree.Node
+
+func Export(root *TreeNode, key int) *TreeNode {
+	return deleteNode(root, key)
+}
+
+/****************************************************/
+/******** 以下为 Leetcode 示例部分（提交PR请还原） *******/
+/******** 使用 (./leetcode clear) 初始化所有问题 *******/
+/****************************************************/
+
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ *     Val int
+ *     Left *TreeNode
+ *     Right *TreeNode
+ * }
+ */
+func deleteNode(root *TreeNode, key int) *TreeNode {
+
+}
diff --git a/questions/serial/中等/450/golang/solution/delete-node-in-a-bst.go.clean b/questions/serial/中等/450/golang/solution/delete-node-in-a-bst.go.clean
@@ -0,0 +1,30 @@
+package solution
+
+// type TreeNode struct {
+// 	Val   int
+// 	Left  *TreeNode
+// 	Right *TreeNode
+// }
+
+type TreeNode = tree.Node
+
+func Export(root *TreeNode, key int) *TreeNode {
+	return deleteNode(root, key)
+}
+
+/****************************************************/
+/******** 以下为 Leetcode 示例部分（提交PR请还原） *******/
+/******** 使用 (./leetcode clear) 初始化所有问题 *******/
+/****************************************************/
+
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ *     Val int
+ *     Left *TreeNode
+ *     Right *TreeNode
+ * }
+ */
+func deleteNode(root *TreeNode, key int) *TreeNode {
+
+}
diff --git a/questions/serial/中等/450/question.md b/questions/serial/中等/450/question.md
@@ -0,0 +1,41 @@
+## [删除二叉搜索树中的节点](https://leetcode-cn.com/problems/delete-node-in-a-bst/)
+
+给定一个二叉搜索树的根节点 **root** 和一个值 **key**，删除二叉搜索树中的 **key **对应的节点，并保证二叉搜索树的性质不变。返回二叉搜索树（有可能被更新）的根节点的引用。
+
+一般来说，删除节点可分为两个步骤：
+
+1.  首先找到需要删除的节点；
+2.  如果找到了，删除它。
+
+**说明：** 要求算法时间复杂度为 O(h)，h 为树的高度。
+
+**示例:**
+
+`
+root = [5,3,6,2,4,null,7]
+key = 3
+
+    5
+   / \
+  3   6
+ / \   \
+2   4   7
+
+给定需要删除的节点值是 3，所以我们首先找到 3 这个节点，然后删除它。
+
+一个正确的答案是 [5,4,6,2,null,null,7], 如下图所示。
+
+    5
+   / \
+  4   6
+ /     \
+2       7
+
+另一个正确答案是 [5,2,6,null,4,null,7]。
+
+    5
+   / \
+  2   6
+   \   \
+    4   7
+`
diff --git a/questions/store.json b/questions/store.json
diff --git a/questions/tags/树/中等/delete-node-in-a-bst/golang/main.go b/questions/tags/树/中等/delete-node-in-a-bst/golang/main.go
@@ -0,0 +1,121 @@
+package main
+
+import (
+	"context"
+	"fmt"
+	"strings"
+	"time"
+
+	"github.com/gladmo/leetcode/leet"
+	"github.com/gladmo/leetcode/questions/serial/中等/450/golang/solution"
+	"github.com/gladmo/leetcode/utils/tree"
+)
+
+func main() {
+	/*
+
+			[5,3,6,2,4,null,7]
+		3
+
+	*/
+
+	tests := []struct {
+		name   string
+		input1 *solution.TreeNode
+		input2 int
+		want   []string
+	}{
+		{
+			name:   "test-[5,2,6,1,4,null,7,null,null,3]",
+			input1: tree.CreateTree("[5,2,6,1,4,null,7,null,null,3]"),
+			input2: 5,
+			want: []string{
+				"[6,3,7,2,4]",
+				"[6,2,7,1,4,null,null,null,null,3]",
+			},
+		},
+		{
+			name:   "test-[5,2,6,1,4,null,7,null,null,3]",
+			input1: tree.CreateTree("[5,2,6,1,4,null,7,null,null,3]"),
+			input2: 7,
+			want: []string{
+				"[5,2,6,1,4,null,null,null,null,3]",
+			},
+		},
+		{
+			name:   "test-[5,2,6,1,4,null,7,null,null,3]",
+			input1: tree.CreateTree("[5,2,6,1,4,null,7,null,null,3]"),
+			input2: 6,
+			want: []string{
+				"[5,2,7,1,4,null,null,null,null,3]",
+			},
+		},
+		{
+			name:   "test-[5,2,6,1,4,null,7,null,null,3]",
+			input1: tree.CreateTree("[5,2,6,1,4,null,7,null,null,3]"),
+			input2: 2,
+			want: []string{
+				"[5,3,6,1,4,null,7]",
+			},
+		},
+		{
+			name:   "test-[5,3,6,2,4,null,7]",
+			input1: tree.CreateTree("[5,3,6,2,4,null,7]"),
+			input2: 3,
+			want: []string{
+				"[5,4,6,2,null,null,7]",
+				"[5,2,6,null,4,null,7]",
+			},
+		},
+		{
+			name:   "test-[5,3,6,2,4,null,7]",
+			input1: tree.CreateTree("[5,3,6,2,4,null,7]"),
+			input2: 0,
+			want: []string{
+				"[5,3,6,2,4,null,7]",
+			},
+		},
+		{
+			name:   "test-[0]",
+			input1: tree.CreateTree("[0]"),
+			input2: 0,
+			want: []string{
+				"[]",
+			},
+		},
+		{
+			name:   "test-[]",
+			input1: tree.CreateTree("[]"),
+			input2: 0,
+			want: []string{
+				"[]",
+			},
+		},
+	}
+
+	testLog := leet.NewTestLog(len(tests))
+	defer testLog.Render()
+
+	timeoutDuration := time.Second * 2
+
+	for idx, test := range tests {
+		// 超时检测
+		timeout := leet.Timeout(timeoutDuration, func(ctx context.Context, cancel context.CancelFunc) {
+
+			cancel()
+		})
+
+		if timeout {
+			testLog.Fail(idx+1, test.name, "timeout")
+			continue
+		}
+
+		got := solution.Export(test.input1, test.input2)
+		if !strings.Contains(strings.Join(test.want, ","), got.String()) {
+			testLog.Fail(idx+1, test.name, fmt.Sprintf("want: %v, got %v.", test.want, got))
+			continue
+		}
+
+		testLog.Pass(idx+1, test.name)
+	}
+}
diff --git a/questions/tags/树/中等/delete-node-in-a-bst/golang/solution/delete-node-in-a-bst.go b/questions/tags/树/中等/delete-node-in-a-bst/golang/solution/delete-node-in-a-bst.go
@@ -0,0 +1,30 @@
+package solution
+
+// type TreeNode struct {
+// 	Val   int
+// 	Left  *TreeNode
+// 	Right *TreeNode
+// }
+
+type TreeNode = tree.Node
+
+func Export(root *TreeNode, key int) *TreeNode {
+	return deleteNode(root, key)
+}
+
+/****************************************************/
+/******** 以下为 Leetcode 示例部分（提交PR请还原） *******/
+/******** 使用 (./leetcode clear) 初始化所有问题 *******/
+/****************************************************/
+
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ *     Val int
+ *     Left *TreeNode
+ *     Right *TreeNode
+ * }
+ */
+func deleteNode(root *TreeNode, key int) *TreeNode {
+
+}
diff --git a/questions/tags/树/中等/delete-node-in-a-bst/golang/solution/delete-node-in-a-bst.go.clean b/questions/tags/树/中等/delete-node-in-a-bst/golang/solution/delete-node-in-a-bst.go.clean
diff --git a/questions/tags/树/中等/delete-node-in-a-bst/question.md b/questions/tags/树/中等/delete-node-in-a-bst/question.md
