LeetCode21合并两个有序链表

未经博主同意，禁止瞎JB转载。

LeetCode21合并两个有序链表

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

这一题在剑指offer上也有

我的解法：

 1 # Definition for singly-linked list.
 2 # class ListNode(object):
 3 #     def __init__(self, x):
 4 #         self.val = x
 5 #         self.next = None
 6 
 7 class Solution(object):
 8     def mergeTwoLists(self, l1, l2):
 9         """
10         :type l1: ListNode
11         :type l2: ListNode
12         :rtype: ListNode
13         """
14         ret = ListNode(0)
15         node = ret
16         while l1 and l2:
17             if l1.val<l2.val:
18                 node.next = ListNode(l1.val)
19                 l1 = l1.next
20             else:
21                 node.next = ListNode(l2.val)
22                 l2 = l2.next
23             node = node.next
24         if l1:
25             node.next = l1
26         if l2:
27             node.next = l2
28         return ret.next

 

posted @ 2018-10-09 21:02  嬴政有条北冥的鱼  阅读(127)  评论(0)  编辑  收藏  举报