Skip to content

Latest commit

 

History

History
 
 

0021. Merge Two Sorted Lists

Folders and files

NameName
Last commit message
Last commit date

parent directory

..
 
 
 
 
 
 

题目

Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.

Example :

Input: 1->2->4, 1->3->4
Output: 1->1->2->3->4->4

题目大意

合并 2 个有序链表

解题思路

按照题意做即可。