21. Merge Two Sorted Lists [easy] (Python)

题目链接

https://leetcode.com/problems/merge-two-sorted-lists/

题目原文

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.

题目翻译

将两个有序链表合并，返回新的链表。新链表应该是两个旧链表剪接得到的。

思路方法

思路一

合并后的链表仍然是有序的，可以同时遍历两个链表，每次选取两个链表中较小值的节点，依次连接起来，就能得到最终的链表。

代码

# Definition for singly-linked list.
# class ListNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.next = None