que-shi-de-shu-zi-lcof

Author: masx200

README.md

@@ -26,6 +26,8 @@ https://leetcode-cn.com/problems/merge-sorted-array/
 
 https://leetcode-cn.com/problems/powx-n/
 
+https://leetcode-cn.com/problems/que-shi-de-shu-zi-lcof/
+
 #### 安装教程
 
 1. 安装`deno`

mod.ts

@@ -3,13 +3,8 @@ import pow_x_n from "./powx-n/index.ts";
 
 import htmlEntityParser from "./html-entity-parser/index.ts";
 
-export {
-    ArrayToListNode,
-    ListNode,
-    ListNodeToArray,
-} from "./reverse-linked-list/index.ts";
 import reverseLinkedList from "./reverse-linked-list/index.ts";
-export { pow_x_n };
+
 import climbStairs from "./climbing-stairs/index.ts";
 import fei_bo_na_qi_shu_lie_lcof from "./fei-bo-na-qi-shu-lie-lcof/index.ts";
 
@@ -22,3 +17,10 @@ export { htmlEntityParser };
 export { reverseLinkedList };
 export { climbStairs };
 export { fei_bo_na_qi_shu_lie_lcof };
+export { pow_x_n };
+export {
+    ArrayToListNode,
+    ListNode,
+    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";

que-shi-de-shu-zi-lcof/index.ts

@@ -0,0 +1,26 @@
+export default function missingNumber(nums: number[]): number {
+    const len = nums.length;
+    for (let i = 0; i < len; i++) {
+        if (i != nums[i]) {
+            return i;
+        }
+    }
+    return len;
+    // const range=(Array.from({length:nums.length+1}).map((_v,i)=>i)
+
+    // );
+    // return sum(range)-sum(nums)
+
+    // // for(const v of nums){
+    // //     // range[v-1]=undefined
+    // //     if(range[v-1]){}
+    // // }
+    // nums.forEach(v=>{
+    // range[v]=undefined
+    // })
+
+    // return range.filter(a=>typeof a!=="undefined")[0]
+}
+// function sum(nums: number[]): number{
+//     return nums.reduce((p,v)=>p+v,0)
+// }

que-shi-de-shu-zi-lcof/test.ts

@@ -0,0 +1,16 @@
+import { assertStrictEquals } from "../deps.ts";
+import { que_shi_de_shu_zi_lcof } from "../mod.ts";
+
+Deno.test("que-shi-de-shu-zi-lcof", () => {
+    const examples: {
+        input: Parameters<typeof que_shi_de_shu_zi_lcof>[0];
+        output: ReturnType<typeof que_shi_de_shu_zi_lcof>;
+    }[] = [
+        { input: [0, 1, 3], output: 2 },
+        { input: [0, 1, 2, 3, 4, 5, 6, 7, 9], output: 8 },
+        { input: [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 11], output: 10 },
+    ];
+    examples.forEach(({ input, output }) => {
+        assertStrictEquals(output, que_shi_de_shu_zi_lcof(input));
+    });
+});