21. 合并两个有序链表

最新推荐文章于 2024-05-04 09:47:06 发布

心向暖

最新推荐文章于 2024-05-04 09:47:06 发布

阅读量88

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/fadbgfnbxb/article/details/93391745

版权

leetcode 专栏收录该内容

96 篇文章 0 订阅

订阅专栏

#include <iostream>
#include <algorithm>
#include "string"
#include "vector"
#include "stack"
using namespace std;

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

ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) 
{
	if (l1 == NULL)
		return l2;
	if (l2 == NULL)
		return l1;
	ListNode *l = NULL;
	if (l1->val <= l2->val)
	{
			l= new ListNode(l1->val);
			l->next = mergeTwoLists(l1->next, l2);
	}
	else
	{
			l = new ListNode(l2->val);
			l->next = mergeTwoLists(l1, l2->next);
	}
	return l;
}


int main()
{
	ListNode *l11=new ListNode(1);
	ListNode *l12 = new ListNode(2);
	ListNode *l13 = new ListNode(4);
	l11->val = 1; l11->next = l12;
	l12->val = 2; l12->next = l13;
	l13->val = 4; l13->next = NULL;
	ListNode *l21 = new ListNode(1);
	ListNode *l22 = new ListNode(3);
	ListNode *l23 = new ListNode(4);
	l21->val = 1; l21->next = l22;
	l22->val = 3; l22->next = l23;
	l23->val = 4; l23->next = NULL;

	cout << (mergeTwoLists(l11, l21))->val;
	
	system("pause");
	return 0;
}