雙向鏈表的基本操作

1、#include <stdio.h>#include <stdlib.h>typedef struct londeint data;struct londe *next;struct londe *pre;londe,*linklist;void print(linklist &L); / 函數(shù)聲明 正序輸出void Intlist(linklist &L) /初始化雙向鏈表L=(linklist)malloc(sizeof(londe);if(!L) exit(0);L->next=L;L->pre=L;void createdouble(

2、linklist &L) /創(chuàng)建雙向鏈表int x;linklist q=L;printf("請輸入要插入的元素的值，輸入以0為結(jié)束n"); scanf("%d",&x);while(x!=0)linklist p=(linklist)malloc(sizeof(londe);p->data=x;q->next=p;p->pre=q;p->next=L;L->pre=p;q=p;scanf("%d",&x);printf("創(chuàng)建完畢，請選擇其他操作!n");pr

3、intf("n");void length(linklist &L) /計算雙向鏈表的長度linklist p,s;int count=0;s=L;printf("長度操作結(jié)果如下:n");p=L->next;while(p!=s)count+;p=p->next;printf("長度為: %dn",count);printf("操作成功!n");printf("n");int rtnlegth(linklist &L) /計算雙向鏈表的長度 linklist p,s

4、;int count=0;p=L->next;s=L;while(p!=s)count+;p=p->next;return(count);void deleted1(linklist &L) /刪除雙向鏈表中的第I個數(shù)據(jù) linklist p,q;int x,num,count=1;q=L;p=L->next;num=rtnlegth(L);printf("請輸入要刪除的數(shù)的位置:");scanf("%d",&x);printf("n");while(count<=num)if(x!=count

5、)p=p->next;q=q->next;elseq->next=p->next;p->next->pre=q;free(p);break;count+;printf("第x個數(shù)據(jù)刪除成功，結(jié)果如下:n"); print(L);void deleted2(linklist &L) /刪除雙向鏈表中數(shù)值等于x的數(shù) linklist p,q;int x,count=1,num;printf("請輸入要刪除數(shù):");scanf("%d",&x);printf("n");

6、q=L;p=q->next;num=rtnlegth(L);while(count<=num)if(p->data=x)q->next=p->next;p->next->pre=q;free(p);break;q=q->next;p=p->next;count+;printf("值為x的數(shù)據(jù)刪除成功，結(jié)果如下:n"); print(L);void qsort(linklist &L) /qsort排序 or 冒泡排序 linklist p;int tem;printf("%dn",rtnleg

7、th(L);for(int i=1;i<rtnlegth(L);i+)p=L->next;for(int j=0;j<rtnlegth(L)-i;j+)if(p->data>=p->next->data) tem=p->data;p->data=p->next->data; p->next->data=tem; p=p->next;printf("冒泡排序結(jié)果如下:n");print(L);printf("n");void insert(linklist &L)

8、/有序插入一個數(shù)字 linklist p;int mm,count=1,num;p=L->next;num=rtnlegth(L);printf("請輸入要插入的數(shù)據(jù):n"); scanf("%d",&mm);linklist q=(linklist)malloc(sizeof(londe); q->data=mm;while(count<num)if(mm>=p->data&&p->next->data>=mm) q->pre=p;q->next=p->next;

9、p->next->pre=q;p->next=q;break;p=p->next;count+;printf("插入后結(jié)果如下:n");print(L);printf("n");void duichen(linklist &L) /判斷對稱linklist p,q;int count,num,flag=1;p=L->next;q=L->pre;count=1;num=rtnlegth(L);printf("%d %dn",p->data,q->data);while(count&

10、lt;=num)if(!(p->data=q->data)printf("bu對稱");flag=0;break;p=p->next;q=q->pre;count+;if(flag)printf("對稱!");elseprintf("不對稱!");printf("n");void jiousort(linklist &L) /奇數(shù)偶數(shù)分離linklist p,q,s;p=L->next;s=L->pre;while(p!=s)if(p->data%2)p=p->

11、;next;elseq=p->next;p->pre->next=p->next;p->next->pre=p->pre; /改變正向鏈表中的序列，使正向鏈表仍導(dǎo)通 p->pre=L->pre;L->pre->next=p;p->next=L;L->pre=p;p=q;printf("奇數(shù)偶數(shù)排序結(jié)果如下:n"); print(L);void print(linklist &L) /正序輸出 linklist p,s;s=L;printf("正序操作結(jié)果如下:n");

12、p=L->next;while(p!=s)printf("%d ",p->data); p=p->next;printf("操作成功!n");printf("n");void print1(linklist &L) /倒序輸出 linklist p,s;printf("倒序操作結(jié)果如下:n"); p=L->pre;s=L;while(p!=s)printf("%d ",p->data); p=p->pre;printf("操作成功!n&quo

13、t;);printf("n");int main()linklist L;int mm;printf("請輸入菜單:n");printf("1:創(chuàng)建一個雙向鏈表n");printf("2:正序輸出n");printf("3:倒序輸出n");printf("4:輸出雙向鏈表的長度為n");printf("5:刪除第x個數(shù)據(jù)n");printf("6:刪除數(shù)值為x的數(shù)據(jù)n");printf("7:冒泡排序:n");pri

14、ntf("8:插入一個有序數(shù):n");printf("9:判斷雙鏈表是否為對稱鏈表:n");printf("10:奇數(shù)與偶數(shù)分離實現(xiàn)奇數(shù)排在鏈表前面:n"); printf("請輸入操作指令: ");while(scanf("%d",&mm)!=EOF)printf("n");switch(mm)case 1:Intlist(L);createdouble(L);break;case 2:print(L);break;case 3:print1(L);break;ca

15、se 4:length(L);break;case 5:deleted1(L);break;case 6:deleted2(L);break;case 7:qsort(L);break;case 8:insert(L);break;case 9:duichen(L);break;case 10:jiousort(L);break;printf("請輸入菜單:n");printf("1:創(chuàng)建一個雙向鏈表n");printf("2:正序輸出n");printf("3:倒序輸出n");printf("4:輸出雙向鏈表的長度為n");printf("5:刪除第x個數(shù)據(jù)n");printf("6