首页 > 其他 > 详细

LeetCode:Merge Two Sorted Lists

时间:2014-10-30 11:43:23      阅读:183      评论:0      收藏: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.


代码:

ListNode * Solution::mergeTwoLists(ListNode *l1, ListNode *l2)
{
    ListNode * newList = NULL;
    ListNode * rear = NULL;
    while(l1 != NULL && l2 != NULL)
    {
        if(l1->val < l2->val)
        {
            insertIntoList(&newList,&rear,l1->val);
            l1 = l1->next;
        }
        else
        {
            insertIntoList(&newList,&rear,l2->val);
            l2 = l2->next;
        }
    }

    while(l1 != NULL)
    {
            insertIntoList(&newList,&rear,l1->val);
            l1 = l1->next;
    }

    while(l2 != NULL)
    {
            insertIntoList(&newList,&rear,l2->val);
            l2 = l2->next;
    }
    return newList;
}

void Solution::insertIntoList(ListNode ** newList,ListNode ** rear,int val)
{
            ListNode * newNode = (ListNode *)malloc((sizeof(ListNode)));
            newNode->val = val;
            newNode->next = NULL;
            if((*newList) == NULL)
            {
                (*newList) = newNode;
                (*rear)    = newNode;
            }
            else
            {
                (*rear)->next = newNode;
                (*rear) = (*rear)->next;
            }
}

LeetCode:Merge Two Sorted Lists

原文:http://blog.csdn.net/yao_wust/article/details/40616603

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!