Merge Two Sorted Lists

最新推荐文章于 2024-01-12 14:30:52 发布

Pango_lulu

最新推荐文章于 2024-01-12 14:30:52 发布

阅读量478

点赞数

分类专栏： Leetcode 文章标签：归并排序

本文链接：https://blog.csdn.net/pango_cs/article/details/44985821

版权

Leetcode 专栏收录该内容

27 篇文章 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.

Tag：两路归并

struct ListNode {
	int val;
   	ListNode *next;
    ListNode(int x) : val(x), next(NULL){}
};

ListNode * mergeTwoLists(ListNode *l1, ListNode *l2)
{
	ListNode * head = NULL;
	ListNode * p = head;
	while(l1 != NULL || l2 != NULL)
	{
		int val = 0;
		if(l1 == NULL)
		{
			val = l2->val;
			l2 = l2->next;
		}
		else if(l2 == NULL)
		{
			val = l1->val;
			l1 = l1->next;
		}
		else
		{
			if(l1->val <= l2->val)
			{
				val = l1->val;
				l1 = l1->next;
			}
			else
			{
				val = l2->val;
				l2 = l2->next;
			}
		}

		ListNode * tmp = new ListNode(val);
		if(head == NULL)
		{
			head = p = tmp;
		}
		else
		{
			p->next = tmp;
			p = p->next;
		}
	}

	return head;
}