本文共 627 字，大约阅读时间需要 2 分钟。

题目：

解答：

代码：

class Solution { public:	 ListNode *mergeTwoLists(ListNode *l1, ListNode *l2) {		 if (l1 == NULL)			 return l2;		 if (l2 == NULL)			 return l1;		 ListNode *head;		 ListNode *last;		 if (l1->val < l2->val)		 {			 head = l1;			 l1 = l1->next;		 }		 else		 {			 head = l2;			 l2 = l2->next;		 }		 last = head;		 while (l1 != NULL && l2 != NULL)		 {			 if (l1->val < l2->val)			 {				 last->next = l1;				 l1 = l1->next;				 last = last->next;			 }			 else			 {				 last->next = l2;				 l2 = l2->next;				 last = last->next;			 }		 }		 if (l1 == NULL)			 last->next = l2;		 else			 last->next = l1;		 return head;	 } };

转载地址：http://qutsi.baihongyu.com/