Untitled
unknown
python
3 years ago
979 B
8
Indexable
class Solution:
def merge(self, nums1: List[int], m: int, nums2: List[int], n: int) -> None:
"""
Do not return anything, modify nums1 in-place instead.
"""
if len(nums1)==1:
nums1=nums2
return nums1
s1 = m-1
s2 = n-1
c = len(nums1) - 1
while(s1>=0 and s2>=0):
if nums1[s1] > nums2[s2]:
nums1[c] = nums1[s1]
s1-=1
else:
nums1[c] = nums2[s2]
s2-=1
c-=1
print(nums1,nums2,s1,s2,c)
if s1>=0:
while s1>0:
nums1[c]=nums1[s1]
s1-=1
c-=1
# nums1[0:c] = nums1[0:s1]
elif s2>=0:
while s2>0:
nums1[c]=nums2[s1]
s1-=1
c-=1
# nums2[0:c] = nums1[0:s2]
print(nums1)
return nums1
Editor is loading...