leetcode 21 —— 合并两个有序链表

   ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) {
        ListNode* ans = new ListNode(0);
        ListNode* head = ans;
        while(l1!=NULL && l2!=NULL){
            if(l1->val<=l2->val){
                ans->next = new ListNode(l1->val);
                l1 = l1->next;
                ans = ans->next;
            }
            else{
                ans->next = new ListNode(l2->val);
                l2 = l2->next;
                ans = ans->next;
            }
        }
        if(l1 != NULL) ans->next=l1;
        if(l2 != NULL) ans->next=l2; 
        return head->next;
    }