[LeetCode By Python] 21. Merge Two Sorted Lists
2018-01-26 20:16
495 查看
题目:
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:
代码+测试代码:
class ListNode(object):
def __init__(self, x):
self.val = x
self.next = None
class Solution(object):
def mergeTwoLists(self, l1, l2):
"""
:type l1: ListNode
:type l2: ListNode
:rtype: ListNode
"""
if l1==l2==None:
return None
if l1 == None:
return l2
if l2 == None:
return l1
results = ListNode(0)
resultsf = results
while l1 and l2:
if l1.val <=l2.val:
resultsf.next = l1
l1 = l1.next
else:
resultsf.next = l2
l2 = l2.next
resultsf = resultsf.next
resultsf.next = l1 or l2
return results.next
if __name__ == '__main__':
l1_1 = ListNode(1)
l1_2 = ListNode(2)
l1_3 = ListNode(4)
l1_1.next = l1_2
l1_2.next = l1_3
l2_1 = ListNode(1)
l2_2 = ListNode(3)
l2_3 = ListNode(4)
l2_1.next = l2_2
l2_2.next = l2_3
l3 = Solution().mergeTwoLists(None,None)
while l3 !=None:
print l3.val
l3 = l3.next
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
代码+测试代码:
class ListNode(object):
def __init__(self, x):
self.val = x
self.next = None
class Solution(object):
def mergeTwoLists(self, l1, l2):
"""
:type l1: ListNode
:type l2: ListNode
:rtype: ListNode
"""
if l1==l2==None:
return None
if l1 == None:
return l2
if l2 == None:
return l1
results = ListNode(0)
resultsf = results
while l1 and l2:
if l1.val <=l2.val:
resultsf.next = l1
l1 = l1.next
else:
resultsf.next = l2
l2 = l2.next
resultsf = resultsf.next
resultsf.next = l1 or l2
return results.next
if __name__ == '__main__':
l1_1 = ListNode(1)
l1_2 = ListNode(2)
l1_3 = ListNode(4)
l1_1.next = l1_2
l1_2.next = l1_3
l2_1 = ListNode(1)
l2_2 = ListNode(3)
l2_3 = ListNode(4)
l2_1.next = l2_2
l2_2.next = l2_3
l3 = Solution().mergeTwoLists(None,None)
while l3 !=None:
print l3.val
l3 = l3.next
相关文章推荐
- LeetCode 21 Merge Two Sorted Lists (C,C++,Java,Python)
- leetcode_[python/C++]_21. Merge Two Sorted Lists(合并有序链表)
- 【LeetCode 21】Merge Two Sorted Lists(Python)
- LeetCode 21 — Merge Two Sorted Lists(C++ Java Python)
- [leetcode:python]21.Merge Two Sorted Lists
- [LeetCode] 21 - Merge Two Sorted Lists
- LeetCode之21----Merge Two Sorted Lists
- # 蜗牛慢慢爬 LeetCode 21. Merge Two Sorted Lists [Difficulty: Easy]
- [Leetcode] 21. Merge Two Sorted Lists
- leetcode 21: Merge Two Sorted Lists
- Leetcode 21 Merge Two Sorted Lists
- LeetCode题解-21-Merge Two Sorted Lists
- [LeetCode] 21. Merge Two Sorted Lists ☆
- LeetCode(21)题解:Merge Two Sorted Lists
- Leetcode 21 Merge Two Sorted Lists
- leetcode-21 Merge Two Sorted Lists
- [LeetCode]21. Merge Two Sorted Lists(C++)
- LeetCode之21----Merge Two Sorted Lists
- leetcode 【 Merge Two Sorted Lists 】 python 实现
- LeetCode:21_Merge Two Sorted Lists | 合并两个排序列表 | Easy