[数据结构]队列使用示例代码

#include <stdio.h>
#include <stdlib.h>


#define MAXSIZE 10
typedef struct Queue {

	int data_queue[MAXSIZE];
	int front;
	int rear;

}Queue;


void Init_Queue(Queue* );
void enqueue(Queue* , int );
void print_queue(Queue* );

int main() {

	Queue queue1;



	Init_Queue(&queue1);
	print_queue(&queue1);



	/*入队*/
	for (int k = 0; k < 10; k++) {

		enqueue(&queue1, 10 * k + 10);

	}

	print_queue(&queue1);


	return 0;
}

void Init_Queue(Queue* input_queue ) 
{
	Queue* str = (Queue*)malloc(sizeof(Queue));
	if (str == NULL) {
		printf("初始队列申请\n");
		return;
	}
	input_queue = str;
	
	(input_queue->front) = 0;
	(input_queue->rear) = -1;
	printf("Init: input_queue->front=%d", input_queue->front);

}




/*入队*/
void enqueue(Queue* input_queue,int intput_value){
	(input_queue->front)++; 
	printf("input_queue->front=%d\n", input_queue->front);
	input_queue->data_queue[(input_queue->front)] = intput_value;//
	
}

void dequeue(Queue* input_queue, int* p_get_value) 
{
	*p_get_value = input_queue->data_queue[input_queue->rear];

	input_queue->rear++;


}

void print_queue(Queue* input_queue) 
{
    int search= input_queue->rear;
	if(input_queue->rear== input_queue->front){
		printf("队列为空队列");
		return;
	}
	printf("input_queue->rear=%d", input_queue->rear);
	while(search!= input_queue->front+1){
		printf("queue[ ]=%d", input_queue->data_queue[search]);
		search++;
	}





}