原题目连接: https://leetcode.com/problems/merge-two-sorted-lists/
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* pMergeHead=NULL;
if(l1==NULL) return l2;
if(l2==NULL) return l1;
if(l1==NULL&&l2==NULL) return NULL;
if(l1->val<l2->val){
pMergeHead=l1;
pMergeHead->next=mergeTwoLists(l1->next,l2);
}
else{
pMergeHead=l2;
pMergeHead->next=mergeTwoLists(l1,l2->next);
}
return pMergeHead;
}
};