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

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.java

1class Solution {
2    public int[] merge(int[] nums1, int[] nums2) {
3        // Your code here
4        return new int[]{};
5    }
6}

Solution

Solve the problem first before reviewing the solution!