find-all-numbers-disappeared-in-an-array

Author: masx200

README.md

@@ -28,6 +28,8 @@ https://leetcode-cn.com/problems/powx-n/
 
 https://leetcode-cn.com/problems/que-shi-de-shu-zi-lcof/
 
+https://leetcode-cn.com/problems/find-all-numbers-disappeared-in-an-array
+
 #### 安装教程
 
 1. 安装`deno`

find-all-numbers-disappeared-in-an-array/index.ts

@@ -0,0 +1,10 @@
+export default function findDisappearedNumbers(nums: number[]): number[] {
+    const range: Array<number | undefined> = Array.from({
+        length: nums.length,
+    }).map((_v, i) => i + 1);
+    nums.forEach((v) => {
+        range[v - 1] = undefined;
+    });
+
+    return range.filter((a) => typeof a !== "undefined") as number[];
+}

find-all-numbers-disappeared-in-an-array/test.ts

@@ -0,0 +1,17 @@
+import { find_all_numbers_disappeared_in_an_array } from "../mod.ts";
+import { assertEquals } from "../deps.ts";
+
+Deno.test("find-all-numbers-disappeared-in-an-array", () => {
+    const examples: {
+        input: Parameters<typeof find_all_numbers_disappeared_in_an_array>[0];
+        output: ReturnType<typeof find_all_numbers_disappeared_in_an_array>;
+    }[] = [
+        { input: [4, 3, 2, 7, 8, 2, 3, 1], output: [5, 6] },
+        { input: [1, 1], output: [2] },
+        { input: [10, 1, 2, 3, 4, 5, 6, 7, 8, 9, 11], output: [] },
+    ];
+    examples.forEach(({ input, output }) => {
+        assertEquals(output, find_all_numbers_disappeared_in_an_array(input));
+    });
+});
+

mod.ts

@@ -24,3 +24,4 @@ export {
     ListNodeToArray,
 } from "./reverse-linked-list/index.ts";
 export { default as que_shi_de_shu_zi_lcof } from "./que-shi-de-shu-zi-lcof/index.ts";
+export { default as find_all_numbers_disappeared_in_an_array } from "./find-all-numbers-disappeared-in-an-array/index.ts";