题目
题目描述
输入两个单调递增的链表,输出两个链表合成后的链表,当然我们需要合成后的链表满足单调不减规则。
对应LeetCode21.
解题思路
暴力求解:
- 新建一个链表;
- 依次判断两个链表的大小,选择小的构建,直至结束。
# -*- 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
if pHead1 is None and pHead2 is None:
return None
if pHead1 is None:
return pHead2
if pHead2 is None:
return pHead1
root = ListNode(0)
first=root
while pHead1 and pHead2:
val1=pHead1.val
val2=pHead2.val
if val1<=val2:
root.next=ListNode(val1)
pHead1=pHead1.next
else:
root.next=ListNode(val2)