时间限制: 1秒 空间限制: 32768K
本题知识点: 链表
题目描述
输入两个单调递增的链表,输出两个链表合成后的链表,当然我们需要合成后的链表满足单调不减规则。
C#语言
/*
public class ListNode
{
public int val;
public ListNode next;
public ListNode (int x)
{
val = x;
}
}*/
public ListNode Merge(ListNode pHead1, ListNode pHead2)
{
ListNode node = new ListNode(-1), node1 = node;
while (pHead1 != null && pHead2 != null)
{
if (pHead1.val < pHead2.val)
{
node = node.next = new ListNode(pHead1.val);
pHead1 = pHead1.next;
}
else
{
node = node.next = new ListNode(pHead2.val);
pHead2 = pHead2.next;
}
}
ListNode node2 = pHead1 != null ? pHead1 : pHead2;
while (node2 != null)
{
node = node.next = new ListNode(node2.val);
node2 = node2.next;
}
return node1.next;
}