力扣：合并两个有序链表

class Solution {
public:
    ListNode* mergeTwoLists(ListNode* list1, ListNode* list2) {
        if(!list1) return list2;
        if(!list2) return list1;
        ListNode* cur = new ListNode(0);
        ListNode* node1 = list1;
        ListNode* node2 = list2;
        ListNode* result = cur;
        while(node1 && node2) {
            if(node1->val > node2->val) {
                cur->next = node2;
                node2 = node2->next;
                cur = cur->next;
            }
            else{
                cur->next = node1;
                node1 = node1->next;
                cur = cur->next;
            }
        }
        if(node1) {
            cur->next = node1;
        }else{
            cur->next = node2;
        }
        return result->next;
    }
};

class Solution {
public:
    ListNode* mergeTwoLists(ListNode* list1, ListNode* list2) {
       if(!list1) return list2;
       if(!list2) return list1;
       if(list1->val > list2->val){
           list2->next = mergeTwoLists(list1,list2->next);
           return list2;
       }
       else {
           list1->next = mergeTwoLists(list1->next,list2);
           return list1;
       }
    }
};