merge-two-sorted-lists

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

You are given the heads of two sorted linked lists <code>list1</code> and <code>list2</code>.

Merge the two lists into one sorted list. The list should be made by splicing together the nodes of the first two lists.

Return the head of the merged linked list.

&nbsp;
Example 1:
<img alt="" src="https://assets.leetcode.com/uploads/2020/10/03/merge_ex1.jpg" style="width: 662px; height: 302px;" />
<pre>
Input: list1 = [1,2,4], list2 = [1,3,4]
Output: [1,1,2,3,4,4]
</pre>

Example 2:

<pre>
Input: list1 = [], list2 = []
Output: []
</pre>

Example 3:

<pre>
Input: list1 = [], list2 = [0]
Output: [0]
</pre>

&nbsp;
Constraints:

<ul>
	<li>The number of nodes in both lists is in the range <code>[0, 50]</code>.</li>
	<li><code>-100 &lt;= Node.val &lt;= 100</code></li>
	<li>Both <code>list1</code> and <code>list2</code> are sorted in non-decreasing order.</li>
</ul>

mergeTwoLists

Merge Two Sorted Lists

Merge k Sorted Lists

merge-k-sorted-lists

合并 K 个升序链表

Merge Sorted Array

merge-sorted-array

合并两个有序数组

Sort List

sort-list

排序链表

Shortest Word Distance II

shortest-word-distance-ii

最短单词距离 II

Add Two Polynomials Represented as Linked Lists

add-two-polynomials-represented-as-linked-lists

求两个多项式链表的和

Longest Common Subsequence Between Sorted Arrays

longest-common-subsequence-between-sorted-arrays

排序数组之间的最长公共子序列

Merge Two 2D Arrays by Summing Values

merge-two-2d-arrays-by-summing-values

合并两个二维数组 - 求和法

Recursion

Linked List

将两个升序链表合并为一个新的 升序 链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。 

 

示例 1：
<img alt="" src="https://assets.leetcode.com/uploads/2020/10/03/merge_ex1.jpg" style="width: 662px; height: 302px;" />
<pre>
输入：l1 = [1,2,4], l2 = [1,3,4]
输出：[1,1,2,3,4,4]
</pre>

示例 2：

<pre>
输入：l1 = [], l2 = []
输出：[]
</pre>

示例 3：

<pre>
输入：l1 = [], l2 = [0]
输出：[0]
</pre>

 

提示：

<ul>
	<li>两个链表的节点数目范围是 <code>[0, 50]</code></li>
	<li><code>-100 <= Node.val <= 100</code></li>
	<li><code>l1</code> 和 <code>l2</code> 均按 非递减顺序 排列</li>
</ul>