[03/09] 實際02/18, 35-searchInsert,根據binary search解決

Author: Yu-Qi

src/35_searchInsert/algo.go

@@ -0,0 +1,23 @@
+package algo
+
+func searchInsert(nums []int, target int) int {
+	start:=0
+	end := len(nums)-1
+	for start+1 < end{
+		middle := (end+start)/2
+		if nums[middle] == target{
+			return middle
+		} else if nums[middle] < target{
+			start = middle+1
+		} else {
+			end = middle-1
+		}
+	}
+	if nums[start] >=target{
+		return start
+	} else if nums[end] < target{
+		return end+1
+	} else{
+		return start+1
+	}
+}

src/35_searchInsert/algo_test.go

@@ -0,0 +1,11 @@
+package algo
+import "testing"
+
+func Test(t *testing.T){
+	if {
+		t.Log("Success")
+	} else{
+		t.Error("Fail")
+	}
+
+}

src/35_searchInsert/go.mod

@@ -0,0 +1,3 @@
+module algo
+
+go 1.17