LeetCode 剑指 Offer 25 合并两个排序的链表

NineZc

于 2020-09-19 16:58:39 发布

阅读量111

点赞数

分类专栏： LeetCode

本文链接：https://blog.youkuaiyun.com/NineZc/article/details/108683331

版权

LeetCode 专栏收录该内容

7 篇文章

订阅专栏

ListNode* mergeTwoLists(ListNode* l1, ListNode* l2)
{
	int num1 = 0;
	int num2 = 0;
	ListNode* head = new ListNode(0);
	ListNode* currHead = head; //声明一个指向head结点的指针
	while (l1!=NULL && l2!=NULL)
	{
		if (l1->val <= l2->val)
		{
			currHead->next = l1;
			l1 = l1->next;
		}
		else
		{
			currHead->next = l2;
			l2 = l2->next;
		}
		currHead = currHead->next;
	}
	if (l1 != NULL)
	{
		currHead->next = l1;
	}
	else
	{
		currHead->next = l2;
	}
	return head->next;
}