<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>

                合規國際互聯網加速 OSASE為企業客戶提供高速穩定SD-WAN國際加速解決方案。 廣告
                ~~~ #include<stdio.h> #include<malloc.h> #include<windows.h> typedef int elemtype; typedef struct qnode //數據節點的定義 { elemtype data; struct qnode *next; }qnode; typedef struct //鏈隊的定義 { qnode *front; qnode *rear; }liqueue; void initqueue(liqueue *&q) //初始化 { q=(liqueue *)malloc(sizeof(liqueue)); q->front=q->rear=NULL; } void enqueue(liqueue *q) //進隊 { int e; qnode *p; p=(qnode *)malloc(sizeof(qnode)); printf("請輸入需進隊元素:"); scanf("%d",&e); p->data=e; p->next=NULL; if(q->rear==NULL) { q->front=q->rear=p; printf("進隊成功!\n"); } else { q->rear->next=p; q->rear=p; printf("進隊成功!\n"); } } void queueempty(liqueue *q) //判斷隊列是否為空 { if(q->rear==NULL) printf("隊列為空!\n"); else printf("隊列不為空!\n"); } void dequeue(liqueue *&q) //出隊列 { int e; qnode *t; if(q->rear==NULL) printf("隊列為空,出隊失敗!\n"); else { t=q->front; e=t->data; if(q->front==q->rear) q->front=q->rear=NULL; else q->front=q->front->next; free(t); printf("元素%d出隊列成功!\n",e);? } } void destroyqueue(liqueue *q) //銷毀鏈隊 { qnode *p=q->front,*r; char t; getchar(); printf("確定要銷毀鏈隊請輸入y,否則不銷毀!\n"); scanf("%c",&t); if(t=='y') { if(p!=NULL) { r=p->next; while(r!=NULL) { free(p); p=r; r=p->next; } } free(p); free(q); printf("銷毀成功\n"); exit(0); } else printf("鏈隊未銷毀!\n"); } void main() { liqueue *q; printf(" ***************歡迎使用鏈隊的運算系統******************\n"); int m; initqueue(q); while(1) { printf("請選擇:"); printf("1 進隊列\n"); printf(" 2 出隊列\n"); printf(" 3 判斷隊列是否為空\n"); printf(" 4 銷毀鏈隊\n"); printf(" 5 退出\n"); scanf("%d",&m); switch(m) { case 1:enqueue(q);break; case 2:dequeue(q);break; case 3:queueempty(q);break; case 4:destroyqueue(q);break; case 5: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>

                              哎呀哎呀视频在线观看