链表的创建及输入输出验证q= p-＞next q-＞next = p-＞next的情况

最新推荐文章于 2023-03-23 18:26:31 发布

原创最新推荐文章于 2023-03-23 18:26:31 发布 · 754 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#链表 #单链表

数据结构与算法专栏收录该内容

2 篇文章

订阅专栏

链表的创建及输入输出

#include<iostream>
#include<cstdlib>
#include<vector>

using namespace std;


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

int main() {
	vector<int> a{2,4,3};

	auto dummy = new ListNode();
	auto tail = dummy;

	for (auto x : a) {
		auto node = new ListNode(x);
		tail = tail->next = node;
	}

	auto head = dummy->next;

	for (auto p = head;p;p = p->next) {
		cout << p->val << endl;

	}
	return 0;
}

验证q= p->next； q->next = p->next的情况

#include<iostream>
#include<cstdlib>
#include<vector>

using namespace std;


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

int main() {
	vector<int> a{ 1, 2, 3, 4, 5};

	auto dummy = new ListNode();
	auto tail = dummy;

	for (auto x : a) {
		auto node = new ListNode(x);
		tail = tail->next = node;
	}

	auto head = dummy->next;
	auto t = head;

	for (auto p = head; p; p = p->next) {
		cout << p->val << endl;
		cout << p->next << endl;
	}


	t = head->next;
	cout << t->val << ' ' << t->next << endl;
	t->next = head->next;
	cout << t->val << ' '<< t->next << endl;


	return 0;
}