[LeetCode 21] Merge Two Sorted Lists 结构体构造函数的知识

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.

关于C++中结构体中的构造函数的知识，参考点击打开链接

写这种代码有种回到大学的感觉

/**
 * 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) {
        if(l1==NULL)
            return l2;
        if(l2==NULL)
            return l1;
        ListNode *head,*tail;
        if(l1->val<l2->val)
        {
            head=l1;
            tail=head;
            l1=l1->next;
            tail->next=NULL;
        }
        else
        {
            head=l2;
            tail=head;
            l2=l2->next;
            tail->next=NULL;
        }
        while(l1!=NULL&&l2!=NULL)
        {
            if(l1->val<l2->val)
            {
                tail->next=l1;
                tail=l1;
                l1=l1->next;
                tail->next=NULL;
            }
            else
            {
                tail->next=l2;
                tail=l2;
                l2=l2->next;
                tail->next=NULL;
            }
        }
        if(l1!=NULL)
            tail->next=l1;
        if(l2!=NULL)
            tail->next=l2;
        return head;
    }
};