链表的基本操作
(1)定义单链表的类型
(2)单链表的初始化
(3)销毁单链表
(4)求单链表的长度
(5)求单链表中第i个元素的运算算法
(6)按值查找运算算法
(7)插入元素运算算法
(8)删除元素运算算法
(9)输出单链表的运算算法
先上代码
#include <bits/stdc++.h>
#define MAX 10000
using namespace std;
/*
Author @liwei
email @1525615956@qq.com
data @2020-9-18
*/
typedef struct Node {
int data;
Node* next;
} Node, *Link;
void InitLink(Node*& L)
{
L = (Node*)malloc(sizeof(Node));
if (L == NULL)
cout << "申请空间失败" << endl;
L->next = NULL;
}
void ClearList(Node* L)
{
Node *p, *q;
p = L->next;
while (p) {
q = p->next;
free(p);
p = q;
}
L->next = NULL;
}
int getlength(Node* L)
{
Node* p;
int length = 0;
p = L->next;
while (p) {
length++;
p = p->next;
}
return length;
}
int GetElem(Node* L, int i)
{
int e;
int j;
Node* p;
p = L->next;
j = 1;
while (p && j < i) {
p = p->next;
j++;
}
if (!p || j > i) {
printf("第%d个节点不存在\n", i);
return 0;
} else
e = p->data;
return e;
}
void Geti(Node* L, int x)
{
Node* p;
int i = 1;
p = (Node*)malloc(sizeof(Node));
p = L->next;
while (p != NULL && p->data != x) {
p = p->next;
i++;
}
if (p != NULL)
cout << "在表的第" << i << "位找到值为" << x << "的结点!" << endl;
else
cout << "未找到结点" << x << endl;
}
void InserLink(Node*& L, int i, int x)
{
Node* p;
p = L;
int j = 1;
while (j < i) {
p = p->next;
j++;
}
Node* s;
s = (Node*)malloc(sizeof(Node));
s->data = x;
s->next = p->next;
p->next = s;
}
void deleteLink(Node*& L, int i)
{
int j;
Node *p, *q;
p = L;
j = 1;
while (j < i) {
p = p->next;
j++;
}
q = p->next;
p->next = p->next->next;
free(q);
}
void putin(Node* L)
{
Node* p;
for (p = L->next; p != NULL; p = p->next) {
printf("%d ", p->data);
}
}
int main()
{
Node* L;
InitLink(L);
InserLink(L, 1, 25);
InserLink(L, 2, 45);
InserLink(L, 3, 56);
cout << "此时链表长度为" << getlength(L) << endl;
cout << GetElem(L, 1) << endl;
Geti(L, 25);
cout << "此时的链表为:" << endl;
putin(L);
deleteLink(L, 1);
cout << endl;
cout << "此时链表长度为" << getlength(L) << endl;
ClearList(L);
return 0;
}
大概就是这亚子,如有问题欢迎评论,在下一定及时改正。