Merge Two Sorted Lists

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

原创最新推荐文章于 2024-01-12 14:30:52 发布 · 593 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode 专栏收录该内容

113 篇文章

订阅专栏

本文介绍了一种将两个已排序的链表合并为一个新排序链表的方法。通过比较两个链表节点的值，按顺序连接节点来创建新的链表。文章提供了完整的C++实现代码。

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.

#include<iostream>
#include<vector>
using namespace std;

//Definition for singly - linked list.
struct ListNode {
	int val;
	ListNode *next;
	ListNode(int x) : val(x), next(NULL) {}
};

ListNode *mergeTwoLists(ListNode *l1, ListNode *l2) {
	ListNode*ResultList = new ListNode(0);
	ListNode*ResultHead = ResultList;
	ListNode*Tmpl1 = l1;
	ListNode*Tmpl2 = l2;
	while (Tmpl1!=NULL&&Tmpl2!=NULL){
		if (Tmpl1->val<=Tmpl2->val){
			ResultHead->next = Tmpl1;
			Tmpl1 = Tmpl1->next;
		}
		else{
			ResultHead->next = Tmpl2;
			Tmpl2 = Tmpl2->next;
		}
		ResultHead = ResultHead->next;
	}
	if (Tmpl1 == NULL&&Tmpl2 != NULL)
		ResultHead->next = Tmpl2;
	else if (Tmpl1 != NULL&&Tmpl2 == NULL)
		ResultHead->next = Tmpl1;
	return ResultList->next;
}