循环链表实现k阶斐波那契数列

/*
循环队列 实现  k阶斐波那契数列

注意：
1、maxsize是队列大小+1，输入的k值不能超过max-1 
2、使用循环注意更新循环变量 

输入：
10 10
20 10
30 20
*/
#include <iostream>
#include <malloc.h>
using namespace std;
const int maxsize = 100+1;
struct Queue{
	int data[maxsize];
	int front, rear;
	int queueSize; 
};

void initQueue(Queue &Q, int len){
	Q.front = Q.rear = 0;
	Q.queueSize = len+1;
}

void enQueue(Queue &Q, int c){
	Q.data[Q.rear] = c;
	Q.rear = (Q.rear+1) % Q.queueSize;
	if(Q.rear == Q.front)
		Q.front = (Q.front+1) % Q.queueSize; 
}

//从头到尾打印队列
void printQueue(Queue Q){
	int i;
	if(Q.rear > Q.front){	//队尾在后队头在前
		for(i = Q.front; i<Q.rear; i++)	
			cout << Q.data[i] << " ";
		cout << endl;
	}else{	//队头在后队尾在前
		for(i = Q.front; i<Q.queueSize; i++)	
			cout << Q.data[i] << " ";
		for(i=0; i<Q.rear; i++)
			cout << Q.data[i] << " ";
		cout << endl;
	}
}

void fibonacci(Queue &q, int max, int k){
	int i;
	for(i=0; i<k; i++)
		enQueue(q, 0);
	enQueue(q, 1);
	int t1 = (q.rear+q.queueSize-1) % q.queueSize;
	int t2 = (q.rear+q.queueSize-2) % q.queueSize;

	while(q.data[t1] + q.data[t2]  <=  max){
		enQueue(q, q.data[t1]+q.data[t2]);
		
		t2 = t1;
		t1 = (t1+q.queueSize+1) % q.queueSize;
	}
}

int main(){
	int max, k;
	cin >> max >> k;
	Queue q;
	initQueue(q, k);
	fibonacci(q, max, k);
	printQueue(q);
	return 0;
}