Leetcode: 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.

/**
 * 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) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        if(l1==NULL)return l2;
		if(l2==NULL)return l1;
		ListNode* head=NULL;
		ListNode* p=NULL;
		while(l1 != NULL && l2 != NULL)
		{
			ListNode* tmp = l1->val < l2->val ? l1 : l2;
			if(p == NULL)
			{
				p = tmp;
				head = tmp;
			}
			else{
				p->next = tmp;
				p=p->next;
			}
			if(tmp == l1) l1=l1->next;
			else l2=l2->next;
		}
		if(l1==NULL) p->next = l2;
		else p->next = l1;
		return head;
    }
};