杨辉三角(循环队列)5页

1、#include <stdio.h>#include <stdlib.h>#include <conio.h>/ EXIT_SUCCESS =0 / EXIT_FAILURE =1 ;/定义循环链表的最大空间为100#define Max_Size 100typedef int ElemType ;typedef int Status ;/定义循环链表的结构体类型typedef struct QueueElemType *data ;int fornt , rear ;Quen ;/-函数声明-Status Init_Queue ( Quen * Q ) ;

2、Status En_Quenue ( Quen * Q , int e ) ;Status De_Quenue ( Quen * Q ) ;Status De_Quenue ( Quen * Q ) ;Status Ge_Quenue ( Quen Q ) ;Status Yang_Hui ( Quen * Q , int line ) ;/-/初始化循环链表StatusInit_Queue ( Quen * Q )Q ->data = ( ElemType * ) malloc ( sizeof ( Max_Size * sizeof ( int ) ) ) ;if ( ! Q -&g

3、t;data )printf ("内存分配不成功，循环链表初始化失败.n" ) ;return EXIT_FAILURE ;/初始化时data0=1 ，则Q->rear = 1Q ->fornt = 0 ;Q ->dataQ ->fornt = 1 ;Q ->rear = 1 ;printf ("循环链表初始化成功.n") ;return EXIT_SUCCESS ;/进队StatusEn_Quenue ( Quen * Q , int e )if ( ( Q ->rear + 1 ) % Max_Size = Q -

4、>fornt ) printf ("队列已满，不能进队.n" ) ;return EXIT_FAILURE ;Q ->dataQ->rear = e ;Q ->rear = ( Q ->rear + 1 ) % Max_Size ;return EXIT_SUCCESS ;/出队StatusDe_Quenue ( Quen * Q )if ( Q ->fornt = Q ->rear )printf ("队列为空，不能出队.n") ;return EXIT_FAILURE ;Q ->fornt = ( Q

5、->fornt + 1 ) % Max_Size ;return EXIT_SUCCESS ;/判队空StatusEm_Quenue ( Quen Q )return Q.fornt = Q .rear ? EXIT_SUCCESS : EXIT_FAILURE ;/取队头元素StatusGe_Quenue ( Quen Q )if ( Q .fornt != Q.rear )printf ("%6d" , Q.dataQ.fornt ) ;/ 若队不空，则返回队头元素return Q.fornt = Q.rear ? 0 : Q.dataQ.fornt ; /打印杨

6、辉三角， line 为要打印杨辉三角的行数StatusYang_Hui ( Quen * Q , int line )/用flag1,falg2分别做标记int flag1 , flag2 ;/用count1计录打印的行数，count2记录每行要出队的次数，如第2行，则要进行2次出队int count1 ,count2;/用a记录队头元素，用former记录上一次的a值int a , former ;int i ;flag1 = 0;flag2 = -1 ;for ( count1 = 1 ; count1 <=line ; count1 + )for ( i = 0 ; i <

7、line - count1 ; i + )printf (" ") ;for ( count2 = 0 ; count2 < count1 ; count2 + )flag1 + ;a = Ge_Quenue ( *Q ) ;De_Quenue ( Q ) ;/当count=1 ,count2 = 0时，将连续进队两个1 ，以后flag1>1 ,都不会再有这种情况if ( 1 = a && 1 = flag1 )En_Quenue ( Q , 1 ) ;En_Quenue ( Q , 1 ) ;former = a ;else/第一次 a=1时，

8、flag2 的值变为1，结束本次循环，用 -1的n次方判断每行的第一个1和最后一个1if ( 1 = a && -1 = flag2 )flag2 *= -1 ;former = a ;En_Quenue ( Q , 1 ) ;continue ;En_Quenue ( Q , former + a ) ;/第二次 a=1时，再次将 flag2 = -1 ,进队1后，跳出当前循环if ( 1 = a && 1 = flag2 ) flag2 *= -1 ;En_Quenue ( Q , 1 ) ;break ;former = a ; printf ("n") ; printf ("n%d行杨辉三角打印成功.n", line ) ; return EXIT_SUCCESS ;int main ( )int line ;Quen Q ;Init_Queue ( & Q ) ;printf