Leecode 21合并两个有序列表

21. Merge Two Sorted Lists

You are given the heads of two sorted linked lists list1 and list2.

Merge the two lists in a one sorted list. The list should be made by splicing together the nodes of the first two lists.

Return the head of the merged linked list.

Example 1:

Input: list1 = [1,2,4], list2 = [1,3,4]
Output: [1,1,2,3,4,4]

Example 2：
Input: list1 = [], list2 = []
Output: []

Example 3:
Input: list1 = [], list2 = [0]
Output: [0]

```cpp
/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode() : val(0), next(nullptr) {}
 *     ListNode(int x) : val(x), next(nullptr) {}
 *     ListNode(int x, ListNode *next) : val(x), next(next) {}
 * };
 */
class Solution {
public:
    ListNode* mergeTwoLists(ListNode* list1, ListNode* list2) {
        ListNode* ans=new ListNode(0);
        ListNode* head=ans;
        if(list1==NULL)
            return list2;
        if(list2==NULL)
            return list1;
        while(list1!=NULL&&list2!=NULL){
            if(list1->val<list2->val)
            {
            head->next=list1;
            list1=list1->next;
            head=head->next;
             }
            else{
            head->next=list2;
            list2=list2->next;   
            head=head->next;
        }}
        head->next=list1==NULL?list2:list1;
        return ans->next;
    }
};