附录：球钟代码

#include<stdio.h>

#include<stdlib.h>

#define ONEMIN 5

#define FIVEMIN 12

#define ONEHOUR 12

#define BALLQUE 28

#define OK 1

#define ERROR 0

typedef int data_t;

typedef struct

{

data_t *data;

int top;//栈顶

int maxlen;

}SqStack;

typedef struct

{

data_t *data;

int front;//队头位置

int rear;//队尾位置

int maxlen;

}SqQueue;

/*************************

*队列部分

**************************/

SqQueue *CreateEmptyQueue(int length)//创建队列

{

SqQueue *sq = (SqQueue*)malloc(sizeof(SqQueue));

if(sq==NULL)

{

printf("CreateEmptyQueue Error\n");

return NULL;

}

sq->data = (data_t*)malloc(sizeof(data_t)*length);

sq->maxlen=length;

sq->front=0;

sq->rear=0;

return sq;

}

int EmptyQueue(SqQueue *Q)//判断队是否为空

{

if(Q==NULL)

{

printf("EmptyQueue Error\n");

return -1;

}

if(Q->rear==Q->front)

return OK;

else

return ERROR;

}

int FullQueue(SqQueue *Q)//判断队是否已满

{

if(Q==NULL)

{

printf("EmptyQueue Error\n");

return -1;

}

if((Q->rear+1)%Q->maxlen==Q->front)

return OK;

else

return ERROR;

}

int EnQueue(SqQueue *Q,data_t e)

{

if(FullQueue(Q)==OK)

{

printf("Queue is Full\n");

return ERROR;

}

Q->data[Q->rear]=e;

Q->rear=(Q->rear+1)%Q->maxlen;

return OK;

}

int DeQueue(SqQueue *Q,data_t *e)

{

if(EmptyQueue(Q)==OK)

{

printf("Queue is Empty\n");

return ERROR;

}

*e=Q->data[Q->front];

Q->front=(Q->front+1)%Q->maxlen;

return OK;

}

/*************************

*栈部分

**************************/

int PushStack(SqStack *s,data_t e)//压栈

{

if(s->top==s->maxlen-1)

{

printf("Stack is Full\n");

return ERROR;

}

s->top++;

s->data[s->top]=e;

return OK;

}

data_t PopStack(SqStack *s)//弹栈

{

if(s->top==-1)

{

printf("Stack is Empty\n");

return ERROR;

}

data_t e=s->data[s->top];

s->top--;

return e;

}

SqStack *CreateEmptyStack(int length)//创建栈

{

SqStack *stack = (SqStack*)malloc(sizeof(SqStack));

if(stack==NULL)

{

printf("CreateEmptyStack Error\n");

exit(0);

}

stack->data = (data_t*)malloc(sizeof(data_t)*length);

stack->maxlen=length;

stack->top=-1;

return stack;

}

int EmptyStack(SqStack *s)//判断栈是否是空栈

{

return -1==s->top?OK:ERROR;

}

int FullStack(SqStack *s)//判断栈是否是满栈

{

return s->maxlen-1==s->top?OK:ERROR;

}

void ShowTime(SqStack *one_min,SqStack *five_min,SqStack *one_hour)//计算球钟内3个栈的小球所代表的时间并打印

{

int hour,minute;

minute=(one_min->top+1)+(five_min->top+1)*5;

hour=one_hour->top+1;

printf("time: %d:%d\n",hour,minute);

}

int main()

{

SqStack *one_min = CreateEmptyStack(ONEMIN);//1分钟栈

SqStack *five_min = CreateEmptyStack(FIVEMIN);//5分钟栈

SqStack *one_hour = CreateEmptyStack(ONEHOUR);//1小时栈

SqQueue *ballque = CreateEmptyQueue(BALLQUE);//球队列

int i;

data_t data;

for(i=1;i<=ballque->maxlen-1;i++)

{

EnQueue(ballque,i);

}

while(1)

{

DeQueue(ballque,&data);//出队一个球

PushStack(one_min,data);//压入1分钟栈中

if(FullStack(one_min)==OK)//如果1分钟栈已满

{

for(i=0;i<one_min->maxlen-1;i++)//弹出4个元素到队列中

{

EnQueue(ballque,PopStack(one_min));

}

PushStack(five_min,PopStack(one_min));//第5个压入5分钟栈

}

if(FullStack(five_min)==OK)//如果5分钟栈已满

{

for(i=0;i<five_min->maxlen-1;i++)//弹出11个元素到队列中

{

EnQueue(ballque,PopStack(five_min));

}

PushStack(one_hour,PopStack(five_min));//第12个元素压入1小时栈

}

if(FullStack(one_hour)==OK)//如果1小时栈已满

{

for(i=0;i<one_hour->maxlen;i++)//弹出12个元素到队列中

{

EnQueue(ballque,PopStack(one_hour));

}

}

ShowTime(one_min,five_min,one_hour);//打印时间

sleep(1);//延时1秒

}

return 0;

}