21. 合并两个有序链表

/**
 * 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) {
		ListNode *dummy = new ListNode(0);
		ListNode *head = dummy;
		while (l1&&l2)
		{
			if (l1->val < l2->val)
			{
				dummy->next = new ListNode(l1->val);//注意这里链表的插入
				l1 = l1->next;
			}
			else if (l1->val >= l2->val)
			{
				dummy->next = new ListNode(l2->val);
				l2 = l2->next;
			}
			dummy = dummy->next;
		}
		if (l1)
			dummy->next = l1;
		else if (l2)
			dummy->next = l2;
		return head->next;
	}
};