Leetcode python

def merge(self, nums1, m, nums2, n):
        while m > 0 and n > 0:
            if nums1[m-1] >= nums2[n-1]:
                nums1[m+n-1] = nums1[m-1]
                m -= 1
            else:
                nums1[m+n-1] = nums2[n-1]
                n -= 1
        if n > 0:
            nums1[:n] = nums2[:n]

Similar codes

0 vote320 views1 answer
Longueur array python
Python
0 vote290 views1 answer
Python MinMaxScaler()
Python
3 votes269 views1 answer
Python 3.9 features
Python
0 vote289 views1 answer
Pandas dataframe get number of occurrence in column
Python
5 votes350 views2 answers
Django admin password reset
Python Django
0 vote311 views1 answer
Selenium proxy with authentication
Python
15 votes310 views6 answers
Python last element of list
Python
11 votes293 views2 answers
__str__()
Python
22 votes310 views6 answers
Python numpy array to list
Python
25 votes281 views6 answers
Python get current time
Python