Merge two Sorted Arrays Without Extra Space
PrashantVIT1 opened this issue · 8 comments
Description
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.
Domain
CPP
Type of Contribution
Addition
Code of Conduct
- I follow Contributing Guidelines & Code of conduct of LearnCPP.
Hello @PrashantVIT1, thanks for creating your first issue at LearnCPP, hope you followed the guidelines.
/assign
This issue has been assigned to PrashantVIT1!
It will become unassigned if it is not closed within 12 days. A maintainer can also add the pinned label to prevent it from being unassigned.
This issue is stale because it has been open 3 days with no activity. Remove stale label or comment or this will be closed in 2 days.
Please check #1572
/remove no-issue-activity
This issue is stale because it has been open 3 days with no activity. Remove stale label or comment or this will be closed in 2 days.
This issue was closed because it has been stalled for 5 days with no activity. Please reopen this issue if not resolved.