shuzuduilie.cpp

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

// shuzuduilie.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 front=-1;
int rear=-1;
int enqueue(int value)
{
	if (rear>=MAXSIZE)
         return -1;
	++rear;
	queue[rear]=value;
}
int dequeue()
{
	if (front==rear)
	   return -1;
	return queue[++front];
}
int main(int argc, char* argv[])
{   
	int temp;
	int input[100];
	int output[100];
	int select;
	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)
			  printf("队列已满");
		  else 
			  input[i_count++]=temp;
	  	break;
      case 2: 
		  if((temp=dequeue())==-1)
               printf("队列是空的");
		  else
		  {
			  printf("取出队列元素%d\n",temp);
			  output[o_count++]=temp;
		  }
		  break;
      case 3:
		  loop=0;
		  break;
	  }
	}
	printf("\n输入队列的元素");
	for (int i=0;i<i_count;i++)
	{
		printf("[%d]",input[i]);
	}
	printf("\n输出队列的元素");
	for (i=0;i<o_count;i++)
	{
		printf("[%d]",output[i]);
	}
	printf("\n剩下队列的元素");
	while ((temp=dequeue())!=-1)
	{
		printf("[%d]",temp);
	}
	printf("\n");
	return 0;
}