剑指 Offer 25. 合并两个排序的链表

剑指 Offer 25. 合并两个排序的链表

class Solution {
public:
    ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) {
        ListNode*head=new ListNode(0),*cur=head;
        while(l1&&l2){
            if(l1->val<=l2->val) {
                cur->next=l1;
                l1=l1->next;
            }else{
                cur->next=l2;
                l2=l2->next;
            } 
            cur=cur->next;   
        }
        cur->next=l1!=NULL?l1:l2;
        return head->next;
    }
};