Today I tried solving the below problem in leetcode:
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.
Whoever knows the mergesort , they will all know this merge functionality.
Below is my solution in C:
I am using temp buffer here. Is it possible to implement this without using temp buffer. Please provide your comments.
Below is my Python solution:
This solution is similar to C. But we can optimize of while loop with a single Python expression I feel. Can you please comment on how to write this expression.
