Merge two Sorted Arrays Without Extra Space

[PrashantVIT1]

Related Issue

• Merge two Sorted Arrays Without Extra Space # 1563

  Proposed Changes

• Addition of new solution

Additional Info

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.

Example 1:

Input: nums1 = [1], m = 1, nums2 = [], n = 0 Output: [1] Explanation: The arrays we are merging are [1] and []. The result of the merge is [1].

Example 2:

Input: nums1 = [1,2,3,0,0,0], m = 3, nums2 = [2,5,6], n = 3 Output: [1,2,2,3,5,6] Explanation: The arrays we are merging are [1,2,3] and [2,5,6]. The result of the merge is [1,2,2,3,5,6] with the underlined elements coming from nums1.

Checklist

• [x] ✅ My code follows the code style of this project.
• [x] 📝 My change requires a change to the README.
• [ ] 🎀 I have updated the README accordingly.
• [x] 👀 I have read the CONTRIBUTING document.
• [ ] ✨ I have added tests to cover my changes.
• [ ] 🚩 All new and existing tests passed.
• [x] 🌟 ed the repo

• [ ] Bug fix (non-breaking change which fixes an issue)
• [ ] New feature (non-breaking change which adds functionality)
• [ ] Breaking change (fix or feature that would cause existing functionality to change)

Output Screenshots

Screenshot #1	Screenshot #2

[github-actions[bot]]

This PR is stale because it has been open 3 days with no activity. Please commit the changes requested or make improvements on the code. Thank you for your contributions!