Tap here to switch tabs
Problem
Submissions

Problem: Merge Sorted Array

Merge Sorted Array combines two sorted integer arrays into one sorted array, placing all elements in nums1 in place. The first array has space reserved for the second.

Statement

You are given two integer arrays, nums1 and nums2, both sorted in non-decreasing order. You are also given two integers, m and n, representing the number of elements in nums1 and nums2, respectively.

Your task is to merge the elements of nums2 into nums1 so that nums1 becomes a single array sorted in non-decreasing order.

The merged result is stored in nums1, which has a total length of m + n. The first m positions contain the initial elements, the last n positions are placeholders (initialized to 0), and nums2 contains the n elements to merge.

Constraints:

  • nums1.length =m+n= m + n
  • nums2.length =n= n
  • 0≤m,n≤2000 \leq m, n \leq 200
  • 1≤m+n≤2001 \leq m + n \leq 200
  • −103≤-10^3 \leq nums1[i], nums2[j] ≤103\leq 10^3
⋮
Tap here to switch tabs
Problem
Submissions

Problem: Merge Sorted Array

Merge Sorted Array combines two sorted integer arrays into one sorted array, placing all elements in nums1 in place. The first array has space reserved for the second.

Statement

You are given two integer arrays, nums1 and nums2, both sorted in non-decreasing order. You are also given two integers, m and n, representing the number of elements in nums1 and nums2, respectively.

Your task is to merge the elements of nums2 into nums1 so that nums1 becomes a single array sorted in non-decreasing order.

The merged result is stored in nums1, which has a total length of m + n. The first m positions contain the initial elements, the last n positions are placeholders (initialized to 0), and nums2 contains the n elements to merge.

Constraints:

  • nums1.length =m+n= m + n
  • nums2.length =n= n
  • 0≤m,n≤2000 \leq m, n \leq 200
  • 1≤m+n≤2001 \leq m + n \leq 200
  • −103≤-10^3 \leq nums1[i], nums2[j] ≤103\leq 10^3