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.
这道题的难度不算特别大，主要是对链表技能的考察。
奉上我写的代码：
class Solution { public: ListNode *mergeTwoLists(ListNode *l1, ListNode *l2) { ListNode head(0), *result = &head; while (l1 && l2) { if (l1->val <= l2->val) { result->next = l1; result = cur->next; l1 = l1->next; } else { result->next = l2; result = cur->next; l2 = l2->next; } } if (l1) result->next = l1; if (l2) result->next = l2; return head.next; } };
HappyLeetcode36:Merge Two Sorted Lists
原文：http://www.cnblogs.com/chengxuyuanxiaowang/p/4189781.html