https://leetcode.cn/problems/find-first-and-last-position-of-element-in-sorted-array/

Author: masx200

README.md

@@ -10,6 +10,8 @@ leetcode 测试
 
 ##### 包含的内容如下
 
+https://leetcode.cn/problems/find-first-and-last-position-of-element-in-sorted-array/
+
 https://leetcode.cn/problems/rearrange-spaces-between-words/
 
 https://leetcode.cn/problems/count-complete-tree-nodes/

deps.ts

@@ -27,5 +27,5 @@ export { default as sum } from "https://cdn.skypack.dev/[email protected]/sum?dts";
 export {
     runScript,
     TreeNode,
-} from "https://cdn.skypack.dev/[email protected].4?dts";
+} from "https://esm.sh/@masx200/[email protected].5";
 export { default as group } from "https://esm.sh/[email protected]";

find-first-and-last-position-of-element-in-sorted-array/index.ts

@@ -0,0 +1,9 @@
+export default function searchRange(nums: number[], target: number): number[] {
+    const right = le(nums, target);
+    const left = ge(nums, target);
+    if (nums[left] === target && nums[right] === target) {
+        return [left, right];
+    }
+    return [-1, -1];
+}
+import { ge, le } from "https://esm.sh/@masx200/[email protected]";

find-first-and-last-position-of-element-in-sorted-array/test.ts

@@ -0,0 +1,17 @@
+import { assertEquals } from "https://deno.land/[email protected]/testing/asserts.ts";
+import searchRange from "./index.ts";
+Deno.test("find-first-and-last-position-of-element-in-sorted-array", () => {
+    const inputs: [nums: number[], target: number][] = [
+        [[5, 7, 7, 8, 8, 10], 8],
+        [[5, 7, 7, 8, 8, 10], 6],
+        [[], 0],
+    ];
+    assertEquals(
+        inputs.map(([a, b]) => searchRange(a, b)),
+        [
+            [3, 4],
+            [-1, -1],
+            [-1, -1],
+        ]
+    );
+});

import_map.json

@@ -1,6 +1,6 @@
 {
     "imports": {
-        "leetcode-class": "https://cdn.skypack.dev/[email protected].4?dts",
+        "leetcode-class": "https://esm.sh/@masx200/[email protected].5",
         "asserts": "https://deno.land/[email protected]/testing/asserts.ts"
     }
 }