B站上有视频:数据结构与算法基础(青岛大学-王卓)
代码:
#define _CRT_SECURE_NO_WARNINGS
#define MAXSIZE 100
#define TRUE 1
#define FALSE 0
#define OK 1
#define ERROR 1
#define INFEASIBLE -1
#define OVERFLOW -2
#include <iostream>
#include<stdio.h>
#include<stdlib.h>
#include<stdbool.h>
typedef int Status;
typedef char ElemType;
//单链表的存储结构
typedef struct LNode
{
ElemType data;
struct LNode* next;
}LNode, * LinkList;
//单链表的初始化
Status InitList_L(LinkList& L)
{
L = new LNode;
L->next = NULL;
return OK;
}
//判断单链表是否为空
int ListEmpty(LinkList L)
{
if (L->next)
return 0; //非空
else
return 1;
}
//单链表的销毁
Status DestroyList_L(LinkList& L)
{
LinkList p;
while (L)
{
p = L;
L = L->next;
delete p;
}
return OK;
}
//单链表的清空
Status ClearList(LinkList& L)
{
LinkList p, q;
p = L->next;
while (p)
{
q = p->next;
delete p;
p = q;
}
L->next = NULL;
return OK;
}
//单链表的表长
int ListLength_L(LinkList L)
{
LinkList p;
p = L->next;
int i = 0;
while(p)
{
i++;
p = p->next;
}
return i;
}
//单链表的取值
Status GetElem_L(LinkList L,int i,ElemType &e)
{
LinkList p = L->next;
int j = 1;
while(p&&j<i)
{
p = p->next;
++j;
}
if (!p || j > i)return ERROR;
e = p->data;
return OK;
}
//单链表的查找
LNode *LocateElem_L(LinkList L,ElemType e)
{
LinkList p = L->next;
while(p&&p->data!=e)
{
p = p->next;
}
return p;
}
//单链表的插入
Status Listinsert_L(LinkList& L, int i, ElemType e)
{
LinkList p = L; int j = 0;
while (p && j < i - 1)
{
p = p->next;
++j;
}
if (p || j > i - 1)return ERROR;
LinkList s = new LNode;
s->data = e;
s->next = p->next;
p->next = s;
}
//单链表的删除
Status ListDelete_L(LinkList &L,int i,ElemType &e)
{
LinkList p = L;
int j = 0;
while(p->next&&j<i-1)
{
p = p->next;
++j;
}
if (!(p->next) || j > i - 1)return ERROR;
LinkList q = p->next;
e = q->data;
p->next = q->next;
delete q;
return OK;
}
//建立单链表:头插法
void CreatList_H(LinkList &L,int n)
{
L = new LNode;
L = L->next = NULL;
for(int i=n;i>0;--i)
{
LinkList p = new LNode;
scanf(&p->data);
p->next = L->next;
L->next = p;
}
}
//建立单链表:尾插法
void CreateList_R(LinkList &L,int n)
{
L = new LNode;
L->next = NULL;
LinkList r = L;
for(int i=0;i<n;++i)
{
LinkList p = new LNode;
scanf(&p->data);
p->next = NULL;
r->next=p;
r = p;
}
}
int main()
{
LinkList L;
return 0;
}
有需要可以在主函数上自己加