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.

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode *mergeTwoLists(ListNode *l1, ListNode *l2) {
        ListNode* prehead=new ListNode(0); //设置头前节点,简化问题
        ListNode* temp_head=prehead;    //指向排好序链表的最后一个节点
        while(l1!=NULL&&l2!=NULL)      //两个链表都不为空情况
            {
            if(l1->val<=l2->val)  
                {
                temp_head->next=l1;
                l1=l1->next;
                temp_head=temp_head->next; 
            }
            else
                {
                temp_head->next=l2;
                l2=l2->next;
                temp_head=temp_head->next;
            }
        }
        while(l1!=NULL)                      //判断两个链表谁为空
            {
            temp_head->next=l1;
            temp_head=temp_head->next;
            l1=l1->next;
        }
        while(l2!=NULL)
            {
            temp_head->next=l2;
            temp_head=temp_head->next;
            l2=l2->next;
        }
        ListNode* res=prehead->next;
        delete prehead;
        return res;
    }
};