easyArraysTwo PointersSortingTwo Pointers

Merge Two Sorted Arrays

Est. Time: 15 minTime: O(n + m)Space: O(n + m)

Description

Given two sorted integer arrays nums1 and nums2, merge them into a single sorted array and return it.

Examples

Example 1 Input:nums1 = [1,2,4], nums2 = [1,3,4]

Output:[1,1,2,3,4,4]

Example 2 Input:nums1 = [], nums2 = [1]

Output:[1]

Constraints

▪0 <= nums1.length, nums2.length <= 200
▪-10^9 <= nums1[i], nums2[i] <= 10^9

Hints

Hint 1Show

Use two pointers, one for each array.

Hint 2Show

Compare elements at both pointers and add the smaller one to the result.

Starter Code

Solution.cpp

1class Solution {
2public:
3    std::vector<int> merge(std::vector<int>& nums1, std::vector<int>& nums2) {
4        // Your code here
5        return {};
6    }
7};

Solution

Solve the problem first before reviewing the solution!

Up Next

Container With Most Water

Back to C++ Problems