https://leetcode-cn.com/problems/merge-sorted-array/

Author: masx200

README.md

@@ -22,6 +22,8 @@ https://leetcode-cn.com/problems/climbing-stairs/
 
 https://leetcode-cn.com/problems/fibonacci-number/
 
+https://leetcode-cn.com/problems/merge-sorted-array/
+
 #### 安装教程
 
 1. 安装`deno`

climbing-stairs/test.ts

@@ -10,6 +10,9 @@ Deno.test("climbing-stairs", () => {
         { input: 1, output: 1 },
         { input: 2, output: 2 },
         { input: 3, output: 3 },
+        { input: 45, output: 1836311903 },
+        { input: 44, output: 1134903170 },
+        { input: 46, output: 1134903170 + 1836311903 },
         { input: 99, output: 354224848179261915075n },
     ];
     examples.forEach(({ input, output }) => {

deps.ts

@@ -3,5 +3,5 @@ import {
     assertEquals,
     assertStrictEquals,
     equal,
-} from "https://deno.land/std@0.133.0/testing/asserts.ts";
+} from "https://deno.land/std@0.134.0/testing/asserts.ts";
 export { assert, assertEquals, assertStrictEquals, equal };

merge-sorted-array/index.ts

@@ -0,0 +1,66 @@
+/**
+ Do not return anything, modify nums1 in-place instead.
+ */
+export default function merge(
+    nums1: number[],
+    m: number,
+    nums2: number[],
+    n: number,
+): void {
+    if (n === 0) {
+        return;
+    }
+    if (m == 0) {
+        nums1.splice(0, n, ...nums2);
+        return;
+    }
+    const temp = nums1.slice(0, m);
+    nums1.length = 0;
+    while (temp.length > 0 && nums2.length > 0) {
+        if (temp[0] > nums2[0]) {
+            const first2 = nums2.shift();
+            if (typeof first2 === "undefined") {
+                throw Error("Invalid number");
+            }
+            nums1.push(first2);
+        } else {
+            const first1 = temp.shift();
+            if (typeof first1 === "undefined") {
+                throw Error("Invalid number");
+            }
+            nums1.push(first1);
+        }
+    }
+    if (nums2.length) {
+        nums1.push(...nums2);
+    }
+    if (temp.length) {
+        nums1.push(...temp);
+    }
+}
+// /**
+//  Do not return anything, modify nums1 in-place instead.
+//  */
+// function merge(nums1: number[], m: number, nums2: number[], n: number): void {
+//     nums1.splice(m, nums1.length - m, ...nums2);
+//     nums1.sort((a, b) => a - b);
+// //   let p1 = 0, p2 = 0;
+// //     const sorted = new Array(m + n).fill(0);
+// //     var cur;
+// //     while (p1 < m || p2 < n) {
+// //         if (p1 === m) {
+// //             cur = nums2[p2++];
+// //         } else if (p2 === n) {
+// //             cur = nums1[p1++];
+// //         } else if (nums1[p1] < nums2[p2]) {
+// //             cur = nums1[p1++];
+// //         } else {
+// //             cur = nums2[p2++];
+// //         }
+// //         sorted[p1 + p2 - 1] = cur;
+// //     }
+// //     for (let i = 0; i != m + n; ++i) {
+// //         nums1[i] = sorted[i];
+// //     }
+
+// };

merge-sorted-array/test.ts

@@ -0,0 +1,19 @@
+import { assertEquals } from "../deps.ts";
+import { mergeSortedArray } from "../mod.ts";
+Deno.test("merge-sorted-array", () => {
+    const examples: {
+        input: Parameters<typeof mergeSortedArray>;
+        output: Parameters<typeof mergeSortedArray>[0];
+    }[] = [
+        {
+            input: [[1, 2, 3, 0, 0, 0], 3, [2, 5, 6], 3],
+            output: [1, 2, 2, 3, 5, 6],
+        },
+        { input: [[1], 1, [], 0], output: [1] },
+        { input: [[0], 0, [1], 1], output: [1] },
+    ];
+    examples.forEach(({ input, output }) => {
+        mergeSortedArray(...input);
+        assertEquals(output, input[0]);
+    });
+});

mod.ts

@@ -1,17 +1,23 @@
+import mergeSortedArray from "./merge-sorted-array/index.ts";
+
 import htmlEntityParser from "./html-entity-parser/index.ts";
-export { htmlEntityParser };
+
 export {
     ArrayToListNode,
     ListNode,
     ListNodeToArray,
 } from "./reverse-linked-list/index.ts";
 import reverseLinkedList from "./reverse-linked-list/index.ts";
-export { reverseLinkedList };
+
 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";
-export { climbStairs };
-export { fei_bo_na_qi_shu_lie_lcof };
+
 import fibonacciNumber from "./fibonacci-number/index.ts";
 import twoSum from "./two-sum/index.ts";
 export { fibonacciNumber };
 export { twoSum };
+export { mergeSortedArray };
+export { htmlEntityParser };
+export { reverseLinkedList };
+export { climbStairs };
+export { fei_bo_na_qi_shu_lie_lcof };