用隊(duì)列方法輸出楊輝三角.doc

/*用隊(duì)列方法輸出楊輝三角。*/#include#include#include#define ElemType int/*-LNode的結(jié)點(diǎn)類型定義-*/struct LNodeElemType data; /值域LNode* next; /鏈接指針域;/*-隊(duì)列的鏈接存儲(chǔ)結(jié)構(gòu)的定義-*/struct LinkQueueLNode* front; /隊(duì)首指針LNode* rear; /隊(duì)尾指針;/*-1.初始化鏈隊(duì)-*/void InitQueue(LinkQueue& HQ)HQ.front=HQ.rear=NULL; /把隊(duì)首和隊(duì)尾指針置為空/*-2.向鏈隊(duì)中插入一個(gè)元素-*/void EnQueue(LinkQueue& HQ, ElemType item)LNode* newptr=new LNode; /得到一個(gè)新的結(jié)點(diǎn)newptr-data=item; /把item 的值賦給新結(jié)點(diǎn)的值域newptr-next=NULL; /把新結(jié)點(diǎn)的指針域置為空if(HQ.rear=NULL) /若鏈隊(duì)為空，則新結(jié)點(diǎn)既是隊(duì)首又是隊(duì)尾HQ.front=HQ.rear=newptr;else /若鏈隊(duì)非空，則新結(jié)點(diǎn)被鏈接到隊(duì)尾并修改隊(duì)尾指針HQ.rear=HQ.rear-next=newptr;/*-3.從隊(duì)列中刪除一個(gè)元素-*/ElemType OutQueue(LinkQueue& HQ)if(HQ.front=NULL) /若鏈隊(duì)為空則終止運(yùn)行cerr鏈隊(duì)為空，無法刪除！data; /暫存隊(duì)首元素以便返回LNode* p=HQ.front; /暫存隊(duì)首指針以便收回隊(duì)首指針HQ.front=p-next; /使隊(duì)首指針指向下一個(gè)結(jié)點(diǎn)if(HQ.front=NULL) /若刪除后鏈隊(duì)為空，則使隊(duì)尾指針為空HQ.rear=NULL;delete p; /回收原隊(duì)首結(jié)點(diǎn)return temp; /返回被刪除的隊(duì)首元素void YanyHuiTriangular(LinkQueue& HQ, int n)int i,j; /i，j 都是循環(huán)變量int first,second; /first,second 分別記錄上一行的兩個(gè)累加數(shù)EnQueue(HQ,1);for(i=1; in+1; i+) /第 0 至 n-1 行元素分別入列，并輸出；最后第 n 行入列first=0; second=0;/控制每行前頭空格的輸出for(j=0; jn-i+1; j+)coutsetw(3) ;for(j=0; ji; j+)second=OutQueue(HQ);coutsetw(3)secondsetw(3) ;EnQueue(HQ,first+second);first=second;coutendl; /輸完一行，回車EnQueue(HQ,second);/最后輸出最后一行元素（即第 n 行出列）for(j=0; jn+1; j+)coutsetw(3)OutQueue(HQ)setw(3) ;coutendl;void main()LinkQueue LQ;InitQ