From 0f4d331b99412538b8a934cbdfb4ca3064b4988a Mon Sep 17 00:00:00 2001 From: YDZ Date: Mon, 23 Dec 2019 03:56:18 +0800 Subject: [PATCH] =?UTF-8?q?=E6=9B=B4=E6=96=B0=20problem=20109=20=E6=B5=8B?= =?UTF-8?q?=E8=AF=95=E7=94=A8=E4=BE=8B?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- ... Sorted List to Binary Search Tree_test.go | 26 +------------------ 1 file changed, 1 insertion(+), 25 deletions(-) diff --git a/Algorithms/0109. Convert Sorted List to Binary Search Tree/109. Convert Sorted List to Binary Search Tree_test.go b/Algorithms/0109. Convert Sorted List to Binary Search Tree/109. Convert Sorted List to Binary Search Tree_test.go index 459c46af..b3ad48c0 100644 --- a/Algorithms/0109. Convert Sorted List to Binary Search Tree/109. Convert Sorted List to Binary Search Tree_test.go +++ b/Algorithms/0109. Convert Sorted List to Binary Search Tree/109. Convert Sorted List to Binary Search Tree_test.go @@ -28,7 +28,7 @@ func Test_Problem109(t *testing.T) { question109{ para109{[]int{-10, -3, 0, 5, 9}}, - ans109{[]int{0, -3, 9, -10, -9999, 5}}, + ans109{[]int{0, -10, 5, NULL, -3, NULL, 9}}, }, question109{ @@ -45,30 +45,6 @@ func Test_Problem109(t *testing.T) { para109{[]int{1, 2, 3}}, ans109{[]int{2, 1, 3}}, }, - // question109{ - // para109{[]int{1, 2, 3, 4, 5}, 2, 2}, - // ans109{[]int{1, 2, 3, 4, 5}}, - // }, - - // question109{ - // para109{[]int{1, 2, 3, 4, 5}, 1, 5}, - // ans109{[]int{5, 4, 3, 2, 1}}, - // }, - - // question109{ - // para109{[]int{1, 2, 3, 4, 5, 6}, 3, 4}, - // ans109{[]int{1, 2, 4, 3, 5, 6}}, - // }, - - // question109{ - // para109{[]int{3, 5}, 1, 2}, - // ans109{[]int{5, 3}}, - // }, - - // question109{ - // para109{[]int{3}, 3, 5}, - // ans109{[]int{3}}, - // }, } fmt.Printf("------------------------Leetcode Problem 109------------------------\n")