[leetcode]-21. Merge Two Sorted Lists（C语言）

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;
 *     struct ListNode *next;
 * };
 */
struct ListNode* mergeTwoLists(struct ListNode* l1, struct ListNode* l2) {
    if(l1==NULL)
        return l2;
    if(l2==NULL)
        return l1;
    struct ListNode *p,*r,*l=(struct ListNode *)malloc(sizeof(struct ListNode));
    p=l;
    r=l;
    while(l1!=NULL&&l2!=NULL)
    {
        if(l1->val<l2->val)
        {
            p=l1;
            l1=l1->next;
        }
        else
        {
            p=l2;
            l2=l2->next;
        }
        r->next=p;
        r=p;
    }
    if(l1!=NULL)
    {
        r->next=l1;
        l1=l1->next;
    }
    if(l2!=NULL)
    {
        r->next=l2;
        l2=l2->next;
    }
    return l->next;
}