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

剑指offer——面试题17：合并两个排序的链表

Solution1：

/*struct ListNode {    int val;    struct ListNode *next;    ListNode(int x) :            val(x), next(NULL) {    }};*/class Solution {public:    ListNode* Merge(ListNode* pHead1, ListNode* pHead2){        if(pHead1 == NULL)            return pHead2;        else if(pHead2 == NULL)            return pHead1;        else{            struct ListNode* ListMergeHead,*ListMergeTail,*temp1 = pHead1,*temp2 = pHead2;            if(temp1->val <= temp2->val){ //找到头指针                ListMergeHead = temp1;                temp1 = temp1->next;            }            else {                ListMergeHead = temp2;                temp2 = temp2->next;            }            ListMergeTail=ListMergeHead;            while(temp1 != NULL && temp2 != NULL){                if(temp1->val <= temp2->val){                    ListMergeTail->next = temp1;                    ListMergeTail = ListMergeTail->next;                    temp1 = temp1->next;                }                else{                    ListMergeTail->next = temp2;                    ListMergeTail = ListMergeTail->next;                    temp2 = temp2->next;                }            }            if(temp1 == NULL)                ListMergeTail->next = temp2;            else                ListMergeTail->next = temp1;            return ListMergeHead;        }    }};

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