Skip to content

problem12.md

Latest commit

 

History

History
14 lines (11 loc) · 717 Bytes

problem12.md

File metadata and controls

14 lines (11 loc) · 717 Bytes

Problem 12: End-to-Beginning Merging (Merge Sorted Array)

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.

Input Format

  • Two integer arrays nums1 and nums2.
  • Two integers m and n.

Example

Input: nums1 = [1, 2, 3, 0, 0, 0], m = 3, nums2 = [2, 5, 6], n = 3
Output: [1, 2, 2, 3, 5, 6]