合并两个有序链表

将两个升序链表合并为一个新的升序链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。

输入：1->2->4, 1->3->4
输出：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){
    struct ListNode* head, *tail, *tmp;
    head = tail = (struct ListNode*)malloc(sizeof(struct ListNode));
    if (l1 == NULL)
        return l2;
    if (l2 == NULL)
        return l1;
    while (l1 != NULL && l2 != NULL) {
        if (l1->val < l2->val) {
            tail->next = l1;
            l1 = l1->next;
        }else {
            tail->next = l2;
            l2 = l2->next;
        }
        tail = tail->next;
    }
    if (l1 == NULL) {
        tail->next = l2;
    }else {
        tail->next = l1;
    }
    tmp = head;
    head = head->next;
    free(tmp);
    return head;

}