<ruby id="bdb3f"></ruby>

    <p id="bdb3f"><cite id="bdb3f"></cite></p>

      <p id="bdb3f"><cite id="bdb3f"><th id="bdb3f"></th></cite></p><p id="bdb3f"></p>
        <p id="bdb3f"><cite id="bdb3f"></cite></p>

          <pre id="bdb3f"></pre>
          <pre id="bdb3f"><del id="bdb3f"><thead id="bdb3f"></thead></del></pre>

          <ruby id="bdb3f"><mark id="bdb3f"></mark></ruby><ruby id="bdb3f"></ruby>
          <pre id="bdb3f"><pre id="bdb3f"><mark id="bdb3f"></mark></pre></pre><output id="bdb3f"></output><p id="bdb3f"></p><p id="bdb3f"></p>

          <pre id="bdb3f"><del id="bdb3f"><progress id="bdb3f"></progress></del></pre>

                <ruby id="bdb3f"></ruby>

                ThinkChat2.0新版上線,更智能更精彩,支持會話、畫圖、視頻、閱讀、搜索等,送10W Token,即刻開啟你的AI之旅 廣告
                單鏈表: ~~~ #include<stdio.h> #include<malloc.h> #include<windows.h> typedef int elemtype; typedef struct LNode //定義單鏈表存儲類型 { elemtype data; struct LNode *next; }linklist; void creatlistf(linklist *&L ) //建立鏈表(頭插法) { linklist *s; int i; elemtype a[10]; printf("請輸入10個數:\n"); for(i=0;i<10;i++) scanf("%d",&a[i]); L=(linklist *)malloc(sizeof(linklist)); L->next=NULL; for(i=0;i<10;i++) { s=(linklist *)malloc(sizeof(linklist)); s->data=a[i]; s->next=L->next; L->next=s; } } void creatlistr(linklist *&L) //建立鏈表(尾插法) { linklist *s,*r; int i; elemtype a[10]; printf("請輸入10個數:\n"); for(i=0;i<10;i++) scanf("%d",&a[i]); L=(linklist *)malloc(sizeof(linklist)); r=L; for(i=0;i<10;i++) { s=(linklist *)malloc(sizeof(linklist)); s->data=a[i]; r->next=s; r=s; } r->next=NULL; } void displist(linklist *L) //輸出單鏈表 { linklist *s; s=L->next; while(s!=NULL) {? printf(" %d",s->data); s=s->next; } printf("\n"); } void listempty(linklist *L) //判斷是否為空 { if(L->next!=NULL) printf("鏈表不為空\n"); else? printf("鏈表為空\n"); } void listlength(linklist *L) //求鏈表的長度 { int n=0; linklist *p=L; while(p->next!=NULL) { n++; p=p->next; } printf("長度為%d\n",n); } void getelem(linklist *L) //取值 { int m,i=0; linklist *p=L; printf("請輸入取出元素位置 "); scanf("%d",&m); while(i<m&&p!=NULL) { i++; p=p->next; } if(p==NULL) printf("error\n"); else printf("取值成功 第%d位的元素為 %d\n",m,p->data); } void locateelem(linklist *L) //按值查找 { int m,i=0; linklist *p=L; printf("請輸入需查找元素值 "); scanf("%d",&m); while(p!=NULL&&p->data!=m) { i++; p=p->next; } if(p==NULL) printf("error\n"); else? printf("元素%d在第%d位\n",m,i); } void listinsert(linklist *L) //插入元素 { int i=0,j,m; linklist *s,*p; printf("請輸入插入位置:"); scanf("%d",&j); printf("請輸入需插入元素:"); scanf("%d",&m); s=L; while(i<j-1 && s!=NULL) { s=s->next; i++; } if(s==NULL) printf("輸入錯誤!\n"); else { p=(linklist *)malloc(sizeof(linklist)); p->data=m; p->next=s->next; s->next=p; } } void listdelete(linklist *&L) //刪除元素 { int i,j=0,e; printf("請輸入需刪除第幾個元素:"); scanf("%d",&i); linklist *s,*q; s=L; while(j<i-1&&s!=NULL) { j++; s=s->next; } if(s==NULL) printf("輸入錯誤!\n");? else { q=s->next; if(q!=NULL) { e=q->data; s->next=q->next; free(q); printf("成功刪除元素%d\n",e); } else printf("輸入錯誤!\n"); } } void destroylist(linklist *&L) //銷毀鏈表 { char t; getchar(); printf("確定要銷毀鏈表請輸入y否則不銷毀: ");? scanf("%c",&t); if(t=='y') { linklist *p=L,*q; q=p->next; while(q!=NULL) { free(p); p=q; q=p->next; } free(p); printf("鏈表已銷毀\n"); exit(0); } } void main() { printf(" ***************歡迎使用單鏈表基本運算系統********************\n"); printf(" ****************如有問題請與本人聯系**************************\n"); linklist *p; int m,n; printf("建表方法:1頭插法建表, 2尾插法建表\n"); printf("請輸入建表方法:"); scanf("%d",&n); if(n==1) creatlistf(p); //調用頭插法建表函數 else if(n==2) creatlistr(p); //調用尾插法建表函數 else? { printf("error\n"); exit(0); } printf("鏈表已建立完畢\n"); while(1) { printf("請選擇:"); printf(" 1.輸出鏈表\n"); printf(" 2.判斷線性表(單鏈表)是否為空\n"); printf(" 3.求線性表(單鏈表)的長度\n"); printf(" 4.從線性表(單鏈表)中取值\n"); printf(" 5.在線性表(單鏈表)中查找元素\n"); printf(" 6.插入元素\n"); printf(" 7.刪除元素\n"); printf(" 8.銷毀鏈表\n"); printf(" 9.退出\n"); scanf("%d",&m); switch(m) { case 1:displist(p);break; case 2:listempty(p);break; case 3:listlength(p);break; case 4:getelem(p);break; case 5:locateelem(p);break; case 6:listinsert(p);break; case 7:listdelete(p);break; case 8:destroylist(p);break; case 9:exit(0); default:printf("輸入錯誤,請重新輸入\n"); } } } ~~~
                  <ruby id="bdb3f"></ruby>

                  <p id="bdb3f"><cite id="bdb3f"></cite></p>

                    <p id="bdb3f"><cite id="bdb3f"><th id="bdb3f"></th></cite></p><p id="bdb3f"></p>
                      <p id="bdb3f"><cite id="bdb3f"></cite></p>

                        <pre id="bdb3f"></pre>
                        <pre id="bdb3f"><del id="bdb3f"><thead id="bdb3f"></thead></del></pre>

                        <ruby id="bdb3f"><mark id="bdb3f"></mark></ruby><ruby id="bdb3f"></ruby>
                        <pre id="bdb3f"><pre id="bdb3f"><mark id="bdb3f"></mark></pre></pre><output id="bdb3f"></output><p id="bdb3f"></p><p id="bdb3f"></p>

                        <pre id="bdb3f"><del id="bdb3f"><progress id="bdb3f"></progress></del></pre>

                              <ruby id="bdb3f"></ruby>

                              哎呀哎呀视频在线观看