dsa/merge_sorted_array.py at main · 121watts/dsa · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
from typing import List

# modify nums1 in place
class Solution:
    def merge(self, nums1: List[int], m: int, nums2: List[int], n: int) -> None:

        p1 = m - 1 # largest value in nums1's index
        p2 = n - 1 # largets value in nums2's index
        p3 = len(nums1) - 1

        while p3 > 0:
            l1 = nums1[p1]
            l2 = nums2[p2]

            if l1 > l2:
                nums1[p3] = l1
                p1 -= 1
                p3 -= 1
            elif l2 > l1:
                nums1[p3] = l2
                p2 -= 1
                p3 -= 1
            else:
                nums1[p3] = l1
                nums1[p3 - 1] = l2
                p1 -= 1
                p2 -= 1
                p3 -= 2


sol = Solution()
nums1 = [1,2,3,0,0,0]
sol.merge(nums1, 3, [2, 5, 6], 3)
print(nums1)

nums1 = [1]
sol.merge(nums1, 1, [], 0)
print(nums1)

nums1 = [0]
sol.merge(nums1, 0, [1], 1)
print(nums1)