From 86a538032a261ceff70e0ca42ae397a80e3103c6 Mon Sep 17 00:00:00 2001 From: marina <138340846+bt3gl-cryptographer@users.noreply.github.com> Date: Mon, 7 Aug 2023 17:26:09 -0700 Subject: [PATCH] Update and rename array-merge-inplace.py to merge_inplace.py --- ...rray-merge-inplace.py => merge_inplace.py} | 19 +------------------ 1 file changed, 1 insertion(+), 18 deletions(-) rename arrays_and_strings/{array-merge-inplace.py => merge_inplace.py} (83%) diff --git a/arrays_and_strings/array-merge-inplace.py b/arrays_and_strings/merge_inplace.py similarity index 83% rename from arrays_and_strings/array-merge-inplace.py rename to arrays_and_strings/merge_inplace.py index 3f14658..d6703e9 100644 --- a/arrays_and_strings/array-merge-inplace.py +++ b/arrays_and_strings/merge_inplace.py @@ -12,14 +12,10 @@ The final sorted array should not be returned by the function, but instead be stored inside the array nums1. To accommodate this, nums1 has a length of m + n, where the first m elements denote the elements that should be merged, and the last n elements are set to 0 and should be ignored. nums2 has a length of n. - """ def merge(big_list: list[int], m: int, small_list: list[int], n: int) -> None: - """ - Do not return anything, modify nums1 in-place instead. - """ - + index_big, index_small, index_backward = m - 1, n - 1, m + n - 1 while index_big >= 0 and index_small >= 0: @@ -42,16 +38,3 @@ def merge(big_list: list[int], m: int, small_list: list[int], n: int) -> None: big_list[index_backward] = small_list[index_small] index_backward -= 1 index_small -= 1 - - - -if __name__ == "__main__": - - nums1 = [1,2,3,0,0,0] - m = 3 - nums2 = [2,5,6] - n = 3 - - merge(nums1, m, nums2, n) - print(nums1) - # [1,2,2,3,5,6]