From 690802e6a1a4ef2a94c4d5ac7fe56ffe5823e5a7 Mon Sep 17 00:00:00 2001 From: argondev22 Date: Fri, 24 Oct 2025 08:14:59 +0900 Subject: [PATCH 1/2] Add implementation for merging two sorted arrays in TypeScript using an in-place approach. Includes comments on status and time taken for reference. --- .../88_merge-sorted-array/20251024.ts | 30 +++++++++++++++++++ 1 file changed, 30 insertions(+) create mode 100644 src/leetcode/88_merge-sorted-array/20251024.ts diff --git a/src/leetcode/88_merge-sorted-array/20251024.ts b/src/leetcode/88_merge-sorted-array/20251024.ts new file mode 100644 index 0000000..4d1dd59 --- /dev/null +++ b/src/leetcode/88_merge-sorted-array/20251024.ts @@ -0,0 +1,30 @@ +/** + Do not return anything, modify nums1 in-place instead. + */ + export function merge(nums1: number[], m: number, nums2: number[], n: number): void { + let i = m - 1; + let j = n - 1; + let k = m + n - 1; + + while (i >= 0 && j >= 0) { + if (nums1[i] > nums2[j]) { + nums1[k] = nums1[i] + i-- + } else { + nums1[k] = nums2[j] + j-- + } + k-- + } + + while (j >= 0) { + nums1[k] = nums2[j] + j-- + k-- + } +}; + +/** + * Status: Accepted + * Time taken: 10 m 59 s + */ \ No newline at end of file From 34f99a54bceb5c59c5cf35587d9e6d9aca0d0693 Mon Sep 17 00:00:00 2001 From: argondev22 Date: Fri, 24 Oct 2025 08:15:46 +0900 Subject: [PATCH 2/2] Remove status and time taken comments from the "Merge Sorted Array" implementation in TypeScript for cleaner code. --- src/leetcode/88_merge-sorted-array/20251024.ts | 5 ----- 1 file changed, 5 deletions(-) diff --git a/src/leetcode/88_merge-sorted-array/20251024.ts b/src/leetcode/88_merge-sorted-array/20251024.ts index 4d1dd59..4abe981 100644 --- a/src/leetcode/88_merge-sorted-array/20251024.ts +++ b/src/leetcode/88_merge-sorted-array/20251024.ts @@ -23,8 +23,3 @@ k-- } }; - -/** - * Status: Accepted - * Time taken: 10 m 59 s - */ \ No newline at end of file