21. Merge Two Sorted Lists

最新推荐文章于 2016-03-09 16:17:00 发布

mll1208596630

最新推荐文章于 2016-03-09 16:17:00 发布

阅读量164

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/mll1208596630/article/details/50753721

版权

LeetCode 专栏收录该内容

37 篇文章 0 订阅

订阅专栏

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* L=NULL;
        ListNode* root=NULL;
        if((!l1)&&(!l2))
            return NULL;
        if(l1&&l2)
        {
            if(l1->val<=l2->val)
            {
                root=l1;
                l1=l1->next;
            }
            else
            {
                root=l2;
                l2=l2->next;
            }
        }
        else
        {
            if(l1)
                return l1;
            else
                return l2;
        }
         L=root;
        while(l1&&l2)
        {
           if(l1->val<=l2->val)
           {
             L->next=l1;
             l1=l1->next;
           }
           else
           {
             L->next=l2;
             l2=l2->next; 
           }
           L=L->next;
        }
        while(l1)
        {
            L->next=l1;
            l1=l1->next;
            L=L->next;
        }
        while(l2)
        {
            L->next=l2;
            l2=l2->next;
            L=L->next;
        }
        return root;
    }
};