LeetCode 021. Merge Two Sorted Lists

最新推荐文章于 2021-12-30 01:40:48 发布

雪水

最新推荐文章于 2021-12-30 01:40:48 发布

阅读量1k

点赞数

分类专栏： Leetcode LeetCode - C++ 文章标签： Leetcode 064 Merge Two Sorted Lis

本文链接：https://blog.csdn.net/wanghuiqi2008/article/details/38856271

版权

Leetcode 同时被 2 个专栏收录

30 篇文章 0 订阅

订阅专栏

LeetCode - C++

30 篇文章 7 订阅

订阅专栏

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) 
    {
        if(!l1 && !l2)
            return NULL;
        else if(!l1)
            return l2;
        else if(!l2)
            return l1;
            
        ListNode * head = NULL;
        ListNode * temp;
        if(l1->val >= l2->val)
        {
            head = l2;
            head->next = mergeTwoLists(l1, l2->next);
        }
        else
        {
            head = l1;
            head->next = mergeTwoLists(l1->next, l2);
        }
        return head;
    }
};

下面采用循环来解决这个问题

class Solution
{
public:
    ListNode *mergeTwoLists(ListNode *l1, ListNode *l2) 
    {
        if(!l1 && !l2)
            return NULL;
        else if(!l1)
            return l2;
        else if(!l2)
            return l1;
        
		ListNode * head = NULL;
        ListNode * p1 = l1;
		ListNode * p2 = l2;

        if(p1->val >= p2->val)
        {
            head = p2;
			p2 = p2->next;
        }
        else
        {
            head = p1;
            p1 = p1->next;
        }
		ListNode * p = head;
		while(p1 || p2)
		{
		    
			if(!p1 || (p2 && p1->val >= p2->val ))
			{
				p->next = p2;
				p2 = p2->next;
			}
			else
			{
				p->next = p1;
				p1 = p1->next;
			}
			p = p->next;
		}

        return head;
    }
};