[LeetCode]Merge Two Sorted 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) {
        if(!l1 && !l2) return l1;
        if(!l1) return l2;
        if(!l2) return l1;
        
        ListNode *l,*l1cur=l1,*l2cur=l2;
		ListNode *lastp;
		l= NULL;
		lastp=NULL;
		while(l1cur!=NULL && l2cur!=NULL)
		{
			ListNode *p = (ListNode*)malloc(sizeof(ListNode));
			p->next = NULL;
			if ( l1cur->val <= l2cur->val)
			{
				p->val = l1cur->val;
				l1cur = l1cur->next;
			}
			else 
			{
				p->val = l2cur->val;
				l2cur = l2cur->next;
			}
			if(lastp== NULL && l==NULL) 
			{
				l=p;
				lastp=p;				
			}

			else
			{ 
				lastp->next=p;
				lastp=p;
			}
		}
		
		if(l1cur) lastp->next = l1cur;
		else lastp->next = l2cur;
		
    	return l;
    }
};