25.合并两个排序的链表
输入两个递增排序的链表,合并这两个链表并使新链表中的节点仍然是递增排序的。
输入:1->2->4, 1->3->4
输出:1->1->2->3->4->4
遍历
class Solution {
public:
ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) {
ListNode* res = new ListNode(0);
ListNode* cur = res;
while(l1 && l2)
{
if(l1->val < l2->val)
{
cur->val=l1->val;
cur=cur->next;
l1=l1->next;
}
else
{
cur->val=l2->val;
cur=cur->next;
l2=l2->next;
}
}
cur->next = l1 == NULL ? l2 : l1;
return res;
}
}
递归???
class Solution {
public:
ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) {
ListNode* res = new ListNode(0);
ListNode* cur = res;
while(l1 && l2)
{
if(l1->val < l2->val)
{
cur->val=l1->val;
cur=cur->next;
l1=l1->next;
}
else
{
cur->val=l2->val;
cur=cur->next;
l2=l2->next;
}
}
cur->next = l1 == NULL ? l2 : l1;
return res;
}
}