From 420c57ee919d819ca78e91ed20468c07a3e1e3f7 Mon Sep 17 00:00:00 2001 From: Dasdron15 Date: Sat, 18 Oct 2025 12:40:50 +0400 Subject: [PATCH 1/2] Add leetcode problem 88 --- leetcode/src/88.c | 30 ++++++++++++++++++++++++++++++ 1 file changed, 30 insertions(+) create mode 100644 leetcode/src/88.c diff --git a/leetcode/src/88.c b/leetcode/src/88.c new file mode 100644 index 0000000000..936e880aaf --- /dev/null +++ b/leetcode/src/88.c @@ -0,0 +1,30 @@ +void merge(int* nums1, int nums1Size, int m, int* nums2, int nums2Size, int n) +{ + if (n == 0) + { + return; + } + + int len1 = nums1Size; + int end_idx = len1 - 1; + while (n > 0 && m > 0) + { + if (nums2[n - 1] >= nums1[m - 1]) + { + nums1[end_idx] = nums2[n - 1]; + n--; + } + else + { + nums1[end_idx] = nums1[m - 1]; + m--; + } + end_idx--; + } + while (n > 0) + { + nums1[end_idx] = nums2[n - 1]; + n--; + end_idx--; + } +} From e37c8123d5092eab527232f4e836e0e3665f2161 Mon Sep 17 00:00:00 2001 From: Dasdron15 Date: Sat, 18 Oct 2025 13:07:48 +0400 Subject: [PATCH 2/2] Add comment to 88.c --- leetcode/src/88.c | 7 +++++++ 1 file changed, 7 insertions(+) diff --git a/leetcode/src/88.c b/leetcode/src/88.c index 936e880aaf..420691d55e 100644 --- a/leetcode/src/88.c +++ b/leetcode/src/88.c @@ -1,3 +1,10 @@ +/** + * Merges two sorted arrays into nums1 in non-decreasing order + * + * nums1 has enough space to hold all elements from nums2 + * The merge is done from the end to avoid overwritten elements + */ + void merge(int* nums1, int nums1Size, int m, int* nums2, int nums2Size, int n) { if (n == 0)