【题目描述】
输入两个单调递增的链表,输出两个链表合成后的链表,当然我们需要合成后的链表满足单调不减规则。
【解题思路】
新建一个排序链表,不断插入两个链表中较小的节点。因为要新建一个列表,所以一开就建立一个元素为0的节点,令一个指针p指向它,最终返回p.next即是排序链表。用Python实现的代码如下:
# -*- coding:utf-8 -*-
# class ListNode:
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution:
# 返回合并后列表
def Merge(self, pHead1, pHead2):
# write code here
resList = ListNode(0)
p = resList
while pHead1 and pHead2:
if pHead1.val <= pHead2.val:
InsertNode = ListNode(pHead1.val)
pHead1 = pHead1.next
else:
InsertNode = ListNode(pHead2.val)
pHead2 = pHead2.next
resList.next = InsertNode
resList = resList.next
if pHead1:
resList.next = pHead1
if pHead2:
resList.next = pHead2
return p.next