Leetcode Solutions Python
Python solution for Leetcode
Python solution of problems from LeetCode.
https://github.com/Garvit244/Leetcode
Baggi
Python solution for Leetcode
Python solution of problems from LeetCode.
https://github.com/Garvit244/Leetcodedef 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]