mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 19:18:14 +08:00
13 lines
544 B
HTML
13 lines
544 B
HTML
|
<p>输入两个递增排序的链表，合并这两个链表并使新链表中的节点仍然是递增排序的。</p>
|
|||
|
|
|
|||
|
|
<p><strong>示例1：</strong></p>
|
|||
|
|
|
|||
|
|
<pre><strong>输入：</strong>1->2->4, 1->3->4
|
|||
|
|
<strong>输出：</strong>1->1->2->3->4->4</pre>
|
|||
|
|
|
|||
|
|
<p><strong>限制：</strong></p>
|
|||
|
|
|
|||
|
|
<p><code>0 <= 链表长度 <= 1000</code></p>
|
|||
|
|
|
|||
|
|
<p>注意：本题与主站 21 题相同：<a href="https://leetcode-cn.com/problems/merge-two-sorted-lists/">https://leetcode-cn.com/problems/merge-two-sorted-lists/</a></p>
|