The Coding Puzzle 🧩
Last week’s puzzle: You are given two integer arrays nums1 and nums2, sorted in non-decreasing order, and two integers m and n, representing the number of elements in nums1 and nums2 respectively.
Merge nums1 and nums2 into a single array sorted in non-decreasing order.
The final sorted array should not be returned by the function, but instead be stored inside the array nums1. To accommodate this, nums1 has a length of m + n, where the first m elements denote the elements that should be merged, and the last n elements are set to 0 and should be ignored. nums2 has a length of n.
Solution for last week's problem:
def merge(self, nums1, m, nums2, n): i=0 for x in range(len(nums1)): if i>=n: break if nums1[x]==0: nums1[x]=nums2[i] i+=1 nums1.sort()
Developer Shares & Headlines 📢
❇️Using APIs Comic
❇️ On-Device Machine Learning
❇️ TensorFlow Hub
Want to recommend someone for our developer spotlight, developer event, or just say hello? Send us an email at yourfriends@devslike.us we want to hear from you!
Social đź’»
YouTube | Podcast| Instagram | Website | Twitter
The Cast on Twitter: Terrence | Clarence | JB
Well, that’s all we have for this week’s issue. A quick reminder to add our Podcast on your favorite platform and subscribe to our YouTube page!
Sincerely,
The DLU Team