Practice Merge Sorted Array
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
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. Follow up: Can you come up with an algorithm that runs in O(m + n) time?
Source: Merge Sorted Array on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
nums1 = [1,2,3,0,0,0], m = 3, nums2 = [2,5,6], n = 3
[1,2,2,3,5,6]
# Example 2
nums1 = [1], m = 1, nums2 = [], n = 0
[1]
# Example 3
nums1 = [0], m = 0, nums2 = [1], n = 1
[1]
Constraints
Related LeetCode Problems
Practice more problems similar to Merge Sorted Array.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.