将两个有序链表合并为一个新的有序链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。
示例:
输入:1->2->4, 1->3->4
输出:1->1->2->3->4->4
class Solution { public: ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) {
ListNode *a = l1;
ListNode *b = l2;
ListNode *r = new ListNode(0);
ListNode *c = r;
int aVal, bVal;
while(a && b){
aVal = a->val;
bVal = b->val;
if(aVal < bVal){
c->next = a;
a = a->next;
}
else{
c->next = b;
b = b->next;
}
c = c->next;
}
if(a)
c->next = a;
else
c->next = b;
return r->next;
}
};