#35 solve with both TypeScript and Golang

leetcode/solutions/0035.SearchInsertPosition/searchInsert.go

@@ -0,0 +1,22 @@
+package solution
+
+func searchInsert(nums []int, target int) int {
+	l := 0
+	r := len(nums) - 1
+
+	for l <= r {
+		mid := (l + r) / 2
+
+		if nums[mid] == target {
+			return mid
+		}
+
+		if nums[mid] < target {
+			l = mid + 1
+		} else {
+			r = mid - 1
+		}
+	}
+
+	return l
+}

leetcode/solutions/0035.SearchInsertPosition/searchInsert.ts

@@ -0,0 +1,20 @@
+export default function searchInsert(nums: number[], target: number): number {
+  let l = 0;
+  let r = nums.length - 1;
+
+  while (l <= r) {
+    const mid = (l + r) >>> 1;
+
+    if (nums[mid] === target) {
+      return mid;
+    }
+
+    if (nums[mid] < target) {
+      l = mid + 1;
+    } else {
+      r = mid - 1;
+    }
+  }
+
+  return l;
+}

leetcode/solutions/0035.SearchInsertPosition/searchInsert_test.go

@@ -0,0 +1,34 @@
+package solution
+
+import "testing"
+
+func Test_0035_SearchInsertPosition(t *testing.T) {
+	result := searchInsert([]int{1, 3, 5, 6}, 5)
+	expected := 2
+
+	if result != expected {
+		t.Errorf("TEST FAILED! got: %#v, want: %#v.", result, expected)
+	}
+
+	result = searchInsert([]int{1, 3, 5, 6}, 2)
+	expected = 1
+
+	if result != expected {
+		t.Errorf("TEST FAILED! got: %#v, want: %#v.", result, expected)
+	}
+
+	result = searchInsert([]int{1, 3, 5, 6}, 7)
+	expected = 4
+
+	if result != expected {
+		t.Errorf("TEST FAILED! got: %#v, want: %#v.", result, expected)
+	}
+
+	result = searchInsert([]int{1, 3, 5, 6}, 0)
+	expected = 0
+
+	if result != expected {
+		t.Errorf("TEST FAILED! got: %#v, want: %#v.", result, expected)
+	}
+
+}

leetcode/solutions/0035.SearchInsertPosition/searchInsert_test.ts

@@ -0,0 +1,10 @@
+import { test } from "https://deno.land/std/testing/mod.ts";
+import { assertEquals } from "https://deno.land/std/testing/asserts.ts";
+import searchInsert from "./searchInsert.ts";
+
+test("0035. Search Insert Position", () => {
+  assertEquals(searchInsert([1, 3, 5, 6], 5), 2);
+  assertEquals(searchInsert([1, 3, 5, 6], 2), 1);
+  assertEquals(searchInsert([1, 3, 5, 6], 7), 4);
+  assertEquals(searchInsert([1, 3, 5, 6], 0), 0);
+});