Leetcode - Merge Two Sorted List

Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.

Example:

Input: 1->2->4, 1->3->4
Output: 1->1->2->3->4->4

代码：

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) {
        ListNode *l3 = NULL;
        ListNode *temp;
        ListNode *l3p;        
        while(l1!= NULL && l2 != NULL){
            temp = (ListNode*)malloc(sizeof(ListNode));
            if(l1->val <= l2->val){                
                temp->val = l1->val;
                l1 = l1->next;                
            }else{                
                temp->val = l2->val;
                l2 = l2->next;                
            }
            temp->next=NULL;
            if(l3 == NULL){
               l3p = temp;
                l3 = l3p;
            }else{
                l3p->next = temp;
                l3p = l3p->next;
            }
                     
        }
        while(l1!=NULL){
            temp = (ListNode*)malloc(sizeof(ListNode));
            temp->val = l1->val;
            l1 = l1->next;
             temp->next=NULL;
            if(l3== NULL){
               l3p = temp;
                l3 = l3p;
            }else{
                l3p->next = temp;
                l3p = l3p->next;
            }
        }
         while(l2!=NULL){
            temp = (ListNode*)malloc(sizeof(ListNode));
            temp->val = l2->val;
            l2 = l2->next;
              temp->next=NULL;
            if(l3 == NULL){
               l3p = temp;
                l3 = l3p;
            }else{
                l3p->next = temp;
                l3p = l3p->next;
            }
        }    
        return l3;
    }
};