热门标签
热门文章
- 1渗透测试入门教程（非常详细）从零基础入门到精通，看完这一篇就够了_网络渗透技术自学
- 2高并发、高可用、微服务架构选型Dubbo与Spring Cloud【纯干货_dubbo并发能力比springcloud
- 3基于MongoDB的高并发高可用政府云平台架构实践
- 4Android GSYVideoPlayer视频播放器_com.shuyu:gsyvideoplayer
- 5入行软件测试10年，谈谈我眼中自动化测试的目的与本质
- 6使用 LlamaIndex 和 Typesense Vector Store 实现向量检索
- 7Python采集热搜评论数据，制作词云分析，又是吃瓜的一天_python怎么做用户评论的词云图分析
- 8外挂知识库的论文总结（后续还会更新）_gar-meets-rag paradigm for zero-shot information r
- 9苹果被大模型打得措手不及
- 10Code Runner for VS Code，下载量突破 4000 万！支持超过50种语言
当前位置: article > 正文
c++链表的创建与节点操作_c++链表的创建与操作
作者：正经夜光杯 | 2024-07-18 15:34:40
赞
踩
c++链表的创建与操作
c++单向链表
节点
//创建结点
struct node
{
int data;
node* next;
};
- 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
1.打印链表
//打印链表信息
void display_list(node * head)
{
node* bac = head->next;
while (bac)
{
cout << bac->data << endl;
bac = bac->next;
}
cout << "-----------------------结束-----------------------------\n\n" << endl;
}
- 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
- 10
- 11
- 12
- 13
- 14
2.创建链表
//创建链表 node * create(int len) { node * head = new node; node* pre = head; for (int i = 0; i < len; i++) { node* p = new node; p->data = i + 1; pre->next = p; pre = p; p->next = NULL; } return head; }
- 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
- 10
- 11
- 12
- 13
- 14
- 15
- 16
- 17
- 18
3.尾部追加
//追加节点 void append_node(node * head) { node* newNode = new node; newNode->data = 67; node* pre = head; while (pre->next) { pre = pre->next; } pre->next = newNode; newNode->next = NULL; this->len = this->len + 1; }
- 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
- 10
- 11
- 12
- 13
- 14
- 15
- 16
- 17
- 18
4.插入
//插入节点 void insert_node(node * head,int pos) { node* pre = head; int i = 0; while (head->next) { if (i == pos-1) { node* newNode = new node; newNode->data = 88; newNode->next = pre->next; pre->next = newNode; this->len = this->len + 1; break; } pre = pre->next; i++; } }
- 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
- 10
- 11
- 12
- 13
- 14
- 15
- 16
- 17
- 18
- 19
- 20
- 21
- 22
- 23
5.删除
//删除节点 void delete_node(node * head,int pos) { node* pre = head; int i = 0; while (pre->next) { if (i == pos-1) { node* temp = pre->next; pre->next = pre->next->next; delete temp; this->len = this->len - 1; break; } pre = pre->next; i++; } }
- 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
- 10
- 11
- 12
- 13
- 14
- 15
- 16
- 17
- 18
- 19
- 20
6.清空链表
//清空链表
void empty(node * head)
{
node* pre = head;
node* p = head->next;
while (head->next)
{
node* temp = pre->next;
pre->next = pre->next->next;
delete temp;
}
this->len = 0;
}
- 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
- 10
- 11
- 12
- 13
示例：
#include <iostream> #include <string> using namespace std; //创建结点 struct node { //数据域 int data; //指针域 node * next; }; //创建链表 node * create(int len) { node * head = new node; node* pre = head; for (int i = 0; i < len; i++) { node* p = new node; p->data = i + 1; pre->next = p; pre = p; p->next = NULL; } return head; } //删除节点 void delete_node(node * head,int pos) { node* pre = head; int i = 0; while (pre->next) { if (i == pos-1) { node* temp = pre->next; pre->next = pre->next->next; delete temp; break; } pre = pre->next; i++; } } //插入节点 void insert_node(node * head,int pos) { node* pre = head; int i = 0; while (head->next) { if (i == pos-1) { node* newNode = new node; newNode->data = 88; newNode->next = pre->next; pre->next = newNode; break; } pre = pre->next; i++; } } //追加节点 void append_node(node * head) { node* newNode = new node; newNode->data = 67; node* pre = head; while (pre->next) { pre = pre->next; } pre->next = newNode; newNode->next = NULL; } //打印链表信息 void display_list(node * head) { node* bac = head->next; while (bac) { cout << bac->data << endl; bac = bac->next; } cout << "-----------------------结束-----------------------------\n\n" << endl; } //清空链表 void empty(node * head) { node* pre = head; node* p = head->next; while (head->next) { node* temp = pre->next; pre->next = pre->next->next; delete temp; } } int main() { node * head = create(5); display_list(head); append_node(head); display_list(head); insert_node(head, 3); display_list(head); delete_node(head, 2); display_list(head); empty(head); display_list(head); return 0; }
- 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
- 10
- 11
- 12
- 13
- 14
- 15
- 16
- 17
- 18
- 19
- 20
- 21
- 22
- 23
- 24
- 25
- 26
- 27
- 28
- 29
- 30
- 31
- 32
- 33
- 34
- 35
- 36
- 37
- 38
- 39
- 40
- 41
- 42
- 43
- 44
- 45
- 46
- 47
- 48
- 49
- 50
- 51
- 52
- 53
- 54
- 55
- 56
- 57
- 58
- 59
- 60
- 61
- 62
- 63
- 64
- 65
- 66
- 67
- 68
- 69
- 70
- 71
- 72
- 73
- 74
- 75
- 76
- 77
- 78
- 79
- 80
- 81
- 82
- 83
- 84
- 85
- 86
- 87
- 88
- 89
- 90
- 91
- 92
- 93
- 94
- 95
- 96
- 97
- 98
- 99
- 100
- 101
- 102
- 103
- 104
- 105
- 106
- 107
- 108
- 109
- 110
- 111
- 112
- 113
- 114
- 115
- 116
- 117
- 118
- 119
- 120
- 121
- 122
- 123
- 124
- 125
- 126
- 127
- 128
- 129
- 130
- 131
- 132
- 133
- 134
- 135
7.写入类中
链表.h
#pragma once struct node; class List { public: int len ; //int arr_index; node* head; //构造函数 List(); //柝构函数 ~List(); //创建链表 void create(int len); //打印链表数据 void display_list(); //尾部追加 void append_node(); //插入节点 void insert_node(int pos); //删除节点 void delete_node(int pos); //释放链表 void empty(); };
- 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
- 10
- 11
- 12
- 13
- 14
- 15
- 16
- 17
- 18
- 19
- 20
- 21
- 22
- 23
- 24
- 25
- 26
- 27
- 28
- 29
- 30
- 31
- 32
- 33
- 34
- 35
- 36
链表.cpp
#include "链表.h" #include <iostream> using namespace std; struct node { int data; node* next; }; List::List() { len = 0; head = new node; } List::~List() { } //创建链表 void List::create(int len) { this->len = len; node* pre = head; for (int i = 0; i < this->len; i++) { node* p = new node; p->data = i + 1; pre->next = p; pre = p; p->next = NULL; } } //打印链表信息 void List::display_list() { node* bac = head->next; while (bac) { cout << bac->data << endl; bac = bac->next; } cout << "-----------------------结束-----------------------------\n\n" << endl; } //尾部追加 void List::append_node() { node* newNode = new node; newNode->data = 67; node* pre = head; while (pre->next) { pre = pre->next; } pre->next = newNode; newNode->next = NULL; this->len = this->len + 1; } 插入节点 void List::insert_node(int pos) { node* pre = head; int i = 0; while (head->next) { if (i == pos-1) { node* newNode = new node; newNode->data = 88; newNode->next = pre->next; pre->next = newNode; this->len = this->len + 1; break; } pre = pre->next; i++; } } //删除节点 void List::delete_node(int pos) { node* pre = head; int i = 0; while (pre->next) { if (i == pos-1) { node* temp = pre->next; pre->next = pre->next->next; delete temp; this->len = this->len - 1; break; } pre = pre->next; i++; } } //清空链表 void List::empty() { node* pre = head; node* p = head->next; while (head->next) { node* temp = pre->next; pre->next = pre->next->next; delete temp; } this->len = 0; }
- 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
- 10
- 11
- 12
- 13
- 14
- 15
- 16
- 17
- 18
- 19
- 20
- 21
- 22
- 23
- 24
- 25
- 26
- 27
- 28
- 29
- 30
- 31
- 32
- 33
- 34
- 35
- 36
- 37
- 38
- 39
- 40
- 41
- 42
- 43
- 44
- 45
- 46
- 47
- 48
- 49
- 50
- 51
- 52
- 53
- 54
- 55
- 56
- 57
- 58
- 59
- 60
- 61
- 62
- 63
- 64
- 65
- 66
- 67
- 68
- 69
- 70
- 71
- 72
- 73
- 74
- 75
- 76
- 77
- 78
- 79
- 80
- 81
- 82
- 83
- 84
- 85
- 86
- 87
- 88
- 89
- 90
- 91
- 92
- 93
- 94
- 95
- 96
- 97
- 98
- 99
- 100
- 101
- 102
- 103
- 104
- 105
- 106
- 107
- 108
- 109
- 110
- 111
- 112
- 113
- 114
- 115
- 116
- 117
- 118
- 119
- 120
- 121
- 122
- 123
- 124
- 125
- 126
- 127
- 128
- 129
- 130
- 131
- 132
- 133
- 134
- 135
- 136
- 137
- 138
- 139
- 140
- 141
测试
main.cpp
#include <iostream> #include "链表.h" using namespace std; int main() { //测试程序 //node* head = new node; List list; list.create(5); list.append_node(); list.insert_node(1); list.delete_node(4); //list.append_node(head); //list.delete_node(head, 1); list.display_list(); list.empty(); list.display_list(); cout << "链表长度" << list.len << endl; list.create(10); list.delete_node(5); list.insert_node(3); list.append_node(); list.display_list(); cout << "链表长度" << list.len << endl; return 0; }
- 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
- 10
- 11
- 12
- 13
- 14
- 15
- 16
- 17
- 18
- 19
- 20
- 21
- 22
- 23
- 24
- 25
- 26
- 27
- 28
- 29
- 30
- 31
声明：本文内容由网友自发贡献，不代表【wpsshop博客】立场，版权归原作者所有，本站不承担相应法律责任。如您发现有侵权的内容，请联系我们。转载请注明出处：https://www.wpsshop.cn/w/正经夜光杯/article/detail/846414
推荐阅读
Copyright © 2003-2013 www.wpsshop.cn 版权所有，并保留所有权利。
