一、单链表定义及其操作
1.定义
typedef struct LNode{
int data;
struct LNode *next;
}*Linklist,Lnode;
2.建立单链表
①尾插法创建新链表(无头节点)
Linklist found(){
Linklist L=NULL;
Lnode *q=L,*s;
int p;
while (1){
scanf("%d",&p);
if(p!=9999){
s=(Lnode*) malloc(sizeof (Lnode));
s->data=p;
if(L==NULL){
L=s;
s->next=NULL;
q=s;
} else{
q->next=s;
q=s;
s->next=NULL;
}
} else break;
}
return L;
}
②尾插法创建新链表(有头节点)
Linklist found2(){
Linklist L=(Lnode *) malloc(sizeof(Lnode));
L->next=NULL;
Lnode *q,*s;
q=L;
int p;
while (1){
scanf("%d",&p);
if(p!=9999){
s=(Lnode *) malloc(sizeof (Lnode));
s->data=p;
q->next=s;
q=s;
s->next=NULL;
} else break;
}
return L;
}
③头插法创建新链表(无头节点)
Linklist found3(){
Linklist L=NULL;
int a;
Lnode *p;
while (1){
scanf("%d",&a);
if(a!=9999){
p=(Lnode *) malloc(sizeof (Lnode));
p->data=a;
p->next=L;
L=p;
} else break;
}
return L;
}
④头插法创建新链表(有头节点)
Linklist found4(){
Linklist L=(Linklist) malloc(sizeof (Lnode));
L->next=NULL;
int a;
Lnode *p;
while (1){
scanf("%d",&a);
if (a!=9999){
p=(Lnode *) malloc(sizeof (Lnode));
p->data=a;
p->next=L->next;
L->next=p;
} else break;
}
return L;
}
3.查找
①按序号查找结点值(无头结点)
int found5(Linklist L,int i){
int a=1;
Lnode *p=L;
while (p&& a<i){
p=p->next;
a++;
}
return p->data;
}
②按序号查找结点值(有头结点)
Lnode *found6(Linklist L,int i){
Lnode *p=L->next;
int a=1;
while (p && a<i){
p=p->next;
a++;
}
return p;
}
③按值查找表结点(无头结点)
Lnode *found7(Linklist L,int a){
Lnode *p=L;
while (p&&p->data!=a){
p=p->next;
}
return p;
}
④按值查找表结点(有头结点)
Lnode *found8(Linklist L,int a){
int i=1;
Lnode *p=L->next;
while (p){
if(p->data==a){
break;
} else{
p=p->next;
i++;
}
}
if(p==NULL){
printf("no number\n");
return L;
} else return p;
}
4.插入
①在第i个结点后面插入一个结点(无头结点)
void insert1(Linklist &L, int i,int a){
Lnode *p=L;
Lnode *s;
int k=1;
while (p){
if(k==i){
s=(Lnode*) malloc(sizeof (Lnode));
s->data=a;
s->next=p->next;
p->next=s;
break;
} else{
p=p->next;
k++;
}
}
}
②在第i个结点后面插入一个结点(有头结点)
void insert4(Linklist &L, int i,int a){
Lnode *p=L->next;
Lnode *s;
int k=1;
while (p){
if(k==(i-1)){
s=(Lnode*) malloc(sizeof (Lnode));
s->data=a;
s->next=p->next;
p->next=s;
break;
} else{
p=p->next;
k++;
}
}
}
③在第i个结点前面插入一个结点(无头结点)
void insert2(Linklist &L, int i,int a){
Lnode *p=L;
Lnode *s;
int k=1;
while (p){
if(k==(i-1)){
s=(Lnode*) malloc(sizeof (Lnode));
s->data=a;
s->next=p->next;
p->next=s;
break;
} else{
p=p->next;
k++;
}
}
}
④在第i个结点前面插入一个结点(有头结点)
void insert3(Linklist &L, int i,int a){
Lnode *p=L->next;
Lnode *s;
int k=1;
while (p){
if(k==i){
s=(Lnode*) malloc(sizeof (Lnode));
s->data=a;
s->next=p->next;
p->next=s;
break;
} else{
p=p->next;
k++;
}
}
}
5.求链表长度:查找单链表中结点个数(有头结点)
int find_Link_nu(Linklist L){
Lnode *p=L->next;
int count=0;
while (p){
count++;
p=p->next;
}
return count;
}
6.删除第i个结点(有头结点)
void Delet(Linklist &L,int i){
Lnode *pre=L,*p=pre->next;
int count=1;
while (count!=i && p){
pre=p;
p=p->next;
count++;
}
if (p==NULL){
pre->next=p;
} else{
pre->next=p->next;
}
return;
}
二、双链表的定义和基本操作
1.定义
typedef struct Dlnode {
int data;
struct Dlnode *pre, *next;
}Dlnode,*DLinklist ;
2.建立有头结点的双链表
①头插法
DLinklist Df1(){
DLinklist L=(DLinklist) malloc(sizeof (DLinklist));
L->next=NULL;
int data;
Dlnode *p;
while (1){
scanf("%d",&data);
if(data!=9999){
p=(Dlnode*) malloc(sizeof (Dlnode));
p->data=data;
if (L->next!=NULL){
p->next=L->next;
L->next->pre=p;
p->pre=L;
L->next=p;
} else{
p->next=NULL;
p->pre=L;
L->next=p;
}
} else break;
}
return L;
}
②尾插法
DLinklist Df2(){
DLinklist L=(DLinklist) malloc(sizeof (DLinklist));
L->next=NULL;
int a;
Dlnode *q=L;
while (1){
scanf("%d",&a);
if(a!=9999){
Dlnode *p=(Dlnode*) malloc(sizeof (Dlnode));
p->data=a;
p->next=NULL;
q->next=p;
p->pre=q;
q=p;
} else break;
}
return L;
}
3.删除
①删除第i个结点的后继结点(有头结点)
int Ddelete(DLinklist &L,int i){
if(L->next==NULL){
return -1;
}
int count=1;
Dlnode *pre=L,*q=pre->next;
while (q && count<=i){
pre=pre->next;
q=q->next;
count++;
}
if(q==NULL){
return -1;
}
if (q->next==NULL){
pre->next=NULL;
free(q);
return 1;
}
pre->next=q->next;
q->next->pre=pre;
free(q);
return 1;
}
②删除第i个结点的前驱结点(有头结点)
int Ddelet2(DLinklist &L,int i){
if(i==1 || L->next==NULL){
return -1;
}
int count=1;
Dlnode *p=L->next;
while (p&&count<(i-1)){
p=p->next;
count++;
}
if (p==NULL){
return -1;
}
p->pre->next=p->next;
free(p);
return 1;
}
三、循环单链表的定义及基本操作
1.建立循环单链表(有头结点)
①头插法
Linklist refound4(){
Linklist L=(Linklist) malloc(sizeof (Lnode));
L->next=L;
int a;
Lnode *p;
while (1){
scanf("%d",&a);
if (a!=9999){
p=(Lnode *) malloc(sizeof (Lnode));
p->data=a;
p->next=L->next;
L->next=p;
} else break;
}
return L;
}
②尾插法
Linklist refound5(){
Linklist L=(Linklist) malloc(sizeof (Lnode));
L->next=L;
int a;
Lnode *s,*q=L;
while (1){
scanf("%d",&a);
if (a!=9999){
s=(Lnode *) malloc(sizeof (Lnode));
s->data=a;
s->next=q->next;
q->next=s;
q=s;
} else break;
}
return L;
}
2.删除循环单链表中第i个结点(有头结点)
void delete_relink(Linklist &L,int i){
int count=1;
Lnode *pre=L,*q=pre->next;
int a= find_reLink_nu(L);
if (i>a || i<=0){
printf("wrong!");
return;
}
while (q!=L && count<i){
q=q->next;
pre=pre->next;
count++;
}
if (count==i) {
pre->next = q->next;
free(q);
printf("right");
return;
}
}
3.在第i个结点后插入一个值为a的结点(有头结点)
void insert_reLin(Linklist &L,int i,int a){
int count=0;
Lnode *pre=L,*p,*s=(Lnode*) malloc(sizeof (Lnode));
int b= find_reLink_nu(L);
if (i>b||i<1){
printf("wrong!\n");
return;
}
while (p!=L && count<i){
p=pre->next;
pre=pre->next;
count++;
}
s->data=a;
if (count==i){
s->next=p->next;
p->next=s;
} else{
s->next=L;
p->next=s;
}
printf("right\n");
}
4.在第i个结点前插入一个值为a的结点(有头结点)
void insert_reLin2(Linklist &L,int i,int a){
int count=0;
Lnode *p=L,*s=(Lnode*)malloc(sizeof (Lnode));
int b= find_reLink_nu(L);
if (i>b||i<1){
printf("wrong!\n");
return;
}
while (count<i-1){
p=p->next;
count++;
}
s->data=a;
s->next=p->next;
p->next=s;
printf("right\n");
}
三、建立循环双链表及基本操作(有头结点)
1.建立循环双链表
①定义
typedef struct Drelnode{
int data;
struct Drelnode *next,*pre;
}Drelnode,*DreLinklist;
②头插法
DreLinklist Dre_found(){
DreLinklist L=(DreLinklist) malloc(sizeof (DreLinklist));
L->next=L;
L->pre=L;
int a;
Drelnode *p;
while (1){
scanf("%d",&a);
if (a!=9999){
p=(Drelnode*) malloc(sizeof (Drelnode));
p->data=a;
L->next->pre=p;
p->next=L->next;
p->pre=L;
L->next=p;
} else break;
}
return L;
}
②尾插法
DreLinklist Dre_found2(){
DreLinklist L=(DreLinklist) malloc(sizeof (DreLinklist));
int a;
L->next=L;
L->pre=L;
Drelnode *p,*q=L;
while (1){
scanf("%d",&a);
if (a!=9999){
p=(Drelnode*) malloc(sizeof (Drelnode));
p->data=a;
q->next=p;
p->pre=q;
p->next=L;
L->pre=p;
q=p;
} else break;
}
return L;
}
2.删除第i个结点
bool Delete_dre(DreLinklist &L,int i){
int count=1;
int a= find_DreLink_nu(L);
if (L->next==L||i>a){
return false;
}
Drelnode *pre=L,*p=pre->next;
while (count<i){
p=p->next;
pre=pre->next;
count++;
}
pre->next=p->next;
p->next->pre=pre;
free(p);
return true;
}
3.在第i个结点后插入一个新结点
void insert_Dre(DreLinklist &L,int i,int data){
Drelnode *p=L->next,*s;
int count=1;
int a = find_DreLink_nu(L);
if (i>a||p==L){
printf("wrong");
return;
}
while (p!=L&&count<i){
p=p->next;
count++;
}
s=(Drelnode*) malloc(sizeof (Drelnode));
s->data=data;
s->next=p->next;
p->next->pre=s;
p->next=s;
s->pre=p;
printf("right\n");
return;
}
4.在第i个结点前插入一个新结点
void insert_Dre_pre(DreLinklist &L,int i,int data){
Drelnode *p=L->next,*s;
int count=1;
int length = find_DreLink_nu(L);
if (i>length){
printf("wrong\n");
return;
}
while (p!=L&&count<i){
p=p->next;
count++;
}
s=(Drelnode*) malloc(sizeof (Drelnode));
s->data=data;
s->pre=p->pre;
p->pre->next=s;
s->next=p;
p->pre=s;
printf("right\n");
return;
}