Cascadiq

Merge Sorted Arrays

algorithm · Level 2 · 15 min

Description

Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array. Assume nums1 has enough space (length = m + n).

Requirements

  • Implement a function that takes nums1, m (number of elements in nums1), nums2, n.
  • Modify nums1 in place so it contains the merged sorted array. Return nums1.

Constraints

- `nums1.length == m + n`, `nums2.length == n` - `0 <= m, n <= 200`

Deliverables

Return the merged nums1.

Tags

ArrayTwo Pointers