loopqueue.cpp

关于数据结构的各章节的c原代码实现

// loopqueue.cpp : Defines the entry point for the console application.
//

#include "stdafx.h"
#include <stdlib.h>
#include <stdio.h>
#define  MAXSIZE 10

int queue[MAXSIZE];
int rear=-1;
int front=-1;
int enqueue(int value)
{
    if (rear+1==front||(rear==MAXSIZE-1&&front<=0))
	{
		printf("无法存入");
	    return -1;
	}
	if (rear==MAXSIZE)
	{
		rear=0;
	}
	queue[++rear]=value;
}
int dequeue()
{
   if (front==rear)
   return -1;
   front++;
   if (front==MAXSIZE)
      front=0;
   return queue[front];

}
int main(int argc, char* argv[])
{    
	int temp;
	int select;
	int input[100];
	int output[100];
	int i_count=0;
	int o_count=0;
	int loop=1;
	while (loop)
	{
		printf("[输入1，取出2，显示全部队列元素3]****>>>");
		scanf("%d",&select);
		switch (select)
		{
		case 1:
			printf("要输入的值%d==》",i_count+1);
			scanf("%d",&temp);
             if (enqueue(temp)!=-1)
             {
				 input[i_count++]=temp;
             }
			 else
				 printf("队列已满\n");
			break;
		case 2:
				if ((temp=dequeue())!=-1)
				{ printf("删除元素%d\n",temp);

				  output[o_count++]=temp;
				}
				  else
					  printf("队列中已经无元素可删除");
				  break;
		case 3:
				loop=0;
				break;
		}
	}
	printf("输入队列的元素\n");
	for (int i=0;i<i_count;i++)
	{
		printf("%3d",input[i]);
	}
    printf("\n");
    printf("输出队列的元素\n");
	for (i=0;i<o_count;i++)
	{
		printf("%3d",output[i]);
	}
    printf("\n");
	printf("队列中剩余的元素：\n");
	while((temp=dequeue())!=-1)
	{
		printf("%3d",temp);
	}
  printf("\n");
	return 0;
}