...

/

Solution: Merge Two Sorted Lists

Solution: Merge Two Sorted Lists

Let's solve the Merge Two Sorted Lists problem.

Statement

Given two integer lists, nums1 and nums2, of size mm and nn, respectively, sorted in nondecreasing order. Merge nums1 and nums2 into a single list sorted in nondecreasing order.

Constraints:

  • 0m,n2000\leq m, n \leq 200

  • 1m+n2001\leq m + n \leq 200 ...

Access this course and 1400+ top-rated courses and projects.