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.
一直没想出原址排序的办法，只能额外开辟空间了。
1 class Solution { 2 public: 3 ListNode *mergeTwoLists(ListNode *l1, ListNode *l2) { 4 ListNode *helper=new ListNode(0); 5 ListNode *head=helper; 6 while(l1 && l2) 7 { 8 if(l1->val<l2->val) helper->next=l1,l1=l1->next; 9 else helper->next=l2,l2=l2->next; 10 helper=helper->next; 11 } 12 if(l1) helper->next=l1; 13 if(l2) helper->next=l2; 14 return head->next; 15 } 16 };
[Leetcode]Merge Two Sorted Lists
原文：http://www.cnblogs.com/desp/p/4340799.html