#define _CRT_SECURE_NO_WARNINGS //solve the scanf error problems
#include
#include
typedef int ElemType;
typedef struct LinkNode {
ElemType data;
struct LinkNode *next;
}LinkNode;
typedef struct LinkQueue {
LinkNode* front, * rear;
}LinkQueue;
void Init_queue(LinkQueue & Q) {
Q.front = Q.rear = (LinkNode*)malloc(sizeof(LinkNode));
Q.front->next=NULL;
}
bool Is_empty(LinkQueue Q) {
if (Q.front == Q.rear) {
return true;
}
else {
return false;
}
}
void EnQueue(LinkQueue& Q, ElemType x) {
LinkNode* s = (LinkNode*)malloc(sizeof(LinkNode));
s->data = x;
s->next = NULL;
Q.rear->next = s;
Q.rear = s;
}
bool DeQueue(LinkQueue &Q, ElemType &x) {
if (Q.front == Q.rear) return false;
LinkNode* p = Q.front->next;
x = p->data;
Q.front->next = p->next;
if (Q.rear == p) Q.rear = Q.front;
free§;
return true;
}
int Fib(int n) {
if (n == 0 || n == 1) return n;
int num = Fib(n - 1) + Fib(n - 2);
return num;
}
int main() {
LinkQueue Q;
bool ret;
ElemType element;
Init_queue(Q);
EnQueue(Q, 3);
EnQueue(Q, 4);
EnQueue(Q, 5);
EnQueue(Q, 6);
ret = DeQueue(Q, element);
if (ret)
{
printf(“succeed,element=%dn”, element);
}
int num;
scanf(“%d”, &num);
printf(“Fib(%d)=%d”, num, Fib(num));
}
