-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmerge_sorted_array.py
More file actions
47 lines (39 loc) · 1.04 KB
/
merge_sorted_array.py
File metadata and controls
47 lines (39 loc) · 1.04 KB
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
45
46
47
"""
88. Merge Sorted Array
"""
from typing import List
class Solution:
def merge(self, nums1: List[int], m: int, nums2: List[int], n: int) -> None:
i = m - 1
j = n - 1
k = m + n - 1
while i >= 0 and j >= 0:
if nums1[i] > nums2[j]:
nums1[k] = nums1[i]
i -= 1
else:
nums1[k] = nums2[j]
j -= 1
k -= 1
while j >= 0:
nums1[k] = nums2[j]
j -= 1
k -= 1
# Test cases
if __name__ == "__main__":
solution = Solution()
# Example 1
nums1 = [1, 2, 3, 0, 0, 0]
nums2 = [2, 5, 6]
solution.merge(nums1, 3, nums2, 3)
print(f"Example 1: {nums1}") # Expected: [1, 2, 2, 3, 5, 6]
# Example 2
nums1 = [1]
nums2 = []
solution.merge(nums1, 1, nums2, 0)
print(f"Example 2: {nums1}") # Expected: [1]
# Example 3
nums1 = [0]
nums2 = [1]
solution.merge(nums1, 0, nums2, 1)
print(f"Example 3: {nums1}") # Expected: [1]