已知有一個回圈雙鏈表，設計一個演算法從該回圈雙鏈表中洗掉值為指定值的所有節點。
uj5u.com熱心網友回復：
僅供參考：//不帶表頭結點的回圈雙向鏈表
#include <stdio.h>
#include <stdlib.h>
#include <malloc.h>
#include <time.h>
#include <locale.h>
struct NODE {
int data;
struct NODE *next;
struct NODE *prev;
} *head,*p,*q,*s,*p1,*p2,*q1,**ta;
int i,k,n,t,m,v,N=10;
int main() {
setlocale(LC_ALL,"chs");
srand(time(NULL));
head=NULL;
printf("創建%d個節點的回圈雙向鏈表:",N);//創建N個節點的回圈雙向鏈表
p=head;
for (i=0;i<N;i++) {
q=(struct NODE *)malloc(sizeof(struct NODE));
if (NULL==q) exit(1);
q->data=https://bbs.csdn.net/topics/rand()%100;//填寫0..99的隨機值
q->next=NULL;
q->prev=NULL;
if (NULL==p) {
head=q;
p=head;
} else {
p->next=q;
q->prev=p;
p=q;
}
}
p->next=head;
head->prev=p;
//輸出整個回圈雙向鏈表
s=head;
while (1) {
if (NULL==s) {
printf("\n");
break;
}
printf("%02d(=)",s->data);
if (NULL!=s->next && s->next->prev!=s) {printf(" !\n");break;}
s=s->next;
if (s==head) {
printf(" Loop\n");
break;
}
}
k=3;
v=5;
printf("將值為%d的結點插入到回圈雙向鏈表的第%d個結點前:",v,k);//將值為v的結點插入到回圈雙向鏈表的第k個結點前
n=0;
p=head;
while (1) {
if (NULL==p) {
break;
}
n++;
if (k==1) {
q=(struct NODE *)malloc(sizeof(struct NODE));
if (NULL==q) exit(1);
q->data=https://bbs.csdn.net/topics/v;
q->next=head;
q->prev=head->prev;
head->prev->next=q;
head->prev=q;
head=q;
break;
} else {
if (k-1==n) {
q=(struct NODE *)malloc(sizeof(struct NODE));
if (NULL==q) exit(1);
q->data=https://bbs.csdn.net/topics/v;
q->next=p->next;
q->prev=p;
p->next->prev=q;
p->next=q;
break;
}
}
p=p->next;
if (p==head) break;
}
//輸出整個回圈雙向鏈表
s=head;
while (1) {
if (NULL==s) {
printf("\n");
break;
}
printf("%02d(=)",s->data);
if (NULL!=s->next && s->next->prev!=s) {printf(" !\n");break;}
s=s->next;
if (s==head) {
printf(" Loop\n");
break;
}
}
k=5;
printf("洗掉第%d個節點:",k);//洗掉第k個節點
n=0;
p=head;
while (1) {
if (NULL==p) {
break;
}
n++;
if (k==1) {
q=head;
head=head->next;
head->prev=q->prev;
q->prev->next=head;
if (q==head) head=NULL;
free(q);
break;
} else {
if (k-1==n) {
q=p->next;
p->next=q->next;
q->next->prev=p;
free(q);
break;
}
}
p=p->next;
if (p==head) break;
}
//輸出整個回圈雙向鏈表
s=head;
while (1) {
if (NULL==s) {
printf("\n");
break;
}
printf("%02d(=)",s->data);
if (NULL!=s->next && s->next->prev!=s) {printf(" !\n");break;}
s=s->next;
if (s==head) {
printf(" Loop\n");
break;
}
}
printf("從小到大排序:");//從小到大排序
for (p=head;p!=NULL;) {
p1=p->prev;
for (q=p->next,q1=p;q!=NULL;) {
if (p->data > q->data) {
//交換data
// printf("swap %02d %02d\n",p->data,q->data);
// t=p->data;p->data=https://bbs.csdn.net/topics/q->data;q->data=t;
//或者
//交換prev和next
// printf("swap %02d %02d\n",p->data,q->data);
if (p==head) {//p是頭
if (p->next==q) {//pq挨著
head=q;
head->prev=p1;
p1->next=q;
p->next=q->next;
p->prev=q;
q->next->prev=p;
q->next=p;
q=p;
p=head;
} else {//pq不挨著
head=q;
head->prev=p1;
p1->next=q;
p2=p->next;
p->next=q->next;
p->next->prev=p;
p->prev=q1;
q->next->prev=p;
q->next=p2;
p2->prev=q;
q1->next=p;
q=p;
p=head;
}
} else {//p不是頭
if (p->next==q) {//pq挨著
p1->next=q;
p->next=q->next;
p->prev=q;
q->next->prev=p;
q->next=p;
q->prev=p1;
q=p;
p=p1->next;
} else {//pq不挨著
p1->next=q;
p2=p->next;
p->next=q->next;
p->prev=q->prev;
q->next->prev=p;
q->next=p2;
q->prev=p1;
p2->prev=q;
q1->next=p;
q=p;
p=p1->next;
}
}
//輸出整個回圈雙向鏈表
// s=head;
// while (1) {
// if (NULL==s) {
// printf("\n");
// break;
// }
// printf("%02d(=)",s->data);
// if (NULL!=s->next && s->next->prev!=s) {printf(" !\n");break;}
// s=s->next;
// if (s==head) {
// printf(" Loop\n");
// break;
// }
// }
// printf("head,p,q:%02d %02d %02d\n",head->data,p->data,q->data);
// getchar();
}
q1=q;q=q->next;
if (q==head) break;
}
p=p->next;
if (p->next==head) break;
}
//輸出整個回圈雙向鏈表并計算鏈表長度n
n=0;
s=head;
while (1) {
if (NULL==s) {
printf("\n");
break;
}
printf("%02d(=)",s->data);
if (NULL!=s->next && s->next->prev!=s) {printf(" !\n");break;}
n++;
s=s->next;
if (s==head) {
printf(" Loop\n");
break;
}
}
printf("將整個鏈表逆序:");//將整個鏈表逆序
if (n>=2) {
p=head;
while (1) {
q=p->prev;p->prev=p->next;p->next=q;
p=p->next;
if (p==head) break;
}
}
//輸出整個回圈雙向鏈表
s=head;
while (1) {
if (NULL==s) {
printf("\n");
break;
}
printf("%02d(=)",s->data);
if (NULL!=s->next && s->next->prev!=s) {printf(" !\n");break;}
s=s->next;
if (s==head) {
printf(" Loop\n");
break;
}
}
m=4;
n=6;
printf("將回圈雙向鏈表中前%d個結點和后%d個結點進行互換:",m,n);//將回圈雙向鏈表中前m個結點和后n個結點進行互換,m+n為鏈表總長
k=0;
p=head;
while (1) {
if (NULL==p) {
break;
}
k++;
if (m==k) {
q=p;
break;
}
p=p->next;
if (p==head) break;
}
head=q->next;
//輸出整個回圈雙向鏈表
s=head;
while (1) {
if (NULL==s) {
printf("\n");
break;
}
printf("%02d(=)",s->data);
if (NULL!=s->next && s->next->prev!=s) {printf(" !\n");break;}
s=s->next;
if (s==head) {
printf(" Loop\n");
break;
}
}
//釋放所有節點
p=head;
while (1) {
if (NULL==p) {
break;
}
q=p->next;
free(p);
p=q;
if (p==head) {
break;
}
}
return 0;
}
//創建10個節點的回圈雙向鏈表:12(=)46(=)31(=)63(=)25(=)91(=)39(=)02(=)92(=)68(=) Loop
//將值為5的結點插入到回圈雙向鏈表的第3個結點前:12(=)46(=)05(=)31(=)63(=)25(=)91(=)39(=)02(=)92(=)68(=) Loop
//洗掉第5個節點:12(=)46(=)05(=)31(=)25(=)91(=)39(=)02(=)92(=)68(=) Loop
//從小到大排序:02(=)05(=)12(=)25(=)31(=)39(=)46(=)68(=)91(=)92(=) Loop
//將整個鏈表逆序:92(=)91(=)68(=)46(=)39(=)31(=)25(=)12(=)05(=)02(=) Loop
//將回圈雙向鏈表中前4個結點和后6個結點進行互換:39(=)31(=)25(=)12(=)05(=)02(=)92(=)91(=)68(=)46(=) Loop
//
轉載請註明出處，本文鏈接：https://www.uj5u.com/houduan/242106.html
標籤：C語言
上一篇：vscode自動補全求助
下一篇：列舉型別前向宣告不標準是什么鬼