LeetCode21

合并两个有序链表

分析

比较easy

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