标签：des style blog color io 问题 div log
[问题描述]
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 ListNode *Solution::mergeTwoLists(ListNode *l1, ListNode *l2) 2 { 3 ListNode *ans = new ListNode(0); 4 ListNode *ans1 = ans; 5 while(l1 != NULL || l2 != NULL){ 6 if (l1 == NULL){ 7 ans->next = l2; 8 break; 9 } 10 else if (l2 == NULL){ 11 ans->next = l1; 12 break; 13 } 14 else{ 15 if (l1->val < l2->val){ 16 ans->next = l1; 17 l1 = l1->next; 18 } 19 else{ 20 ans->next = l2; 21 l2 = l2->next; 22 } 23 ans = ans->next; 24 } 25 } 26 return ans1->next; 27 }
leetcode -- Merge Two Sorted Lists,布布扣,bubuko.com
leetcode -- Merge Two Sorted Lists
标签：des style blog color io 问题 div log
原文地址：http://www.cnblogs.com/taizy/p/3911098.html
