linkqueue.cpp

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

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

#include "stdafx.h"
#include <stdio.h>
#include <stdlib.h>
struct queue_node
{
	int data;
	struct queue_node *next;
};
typedef struct queue_node node;
typedef node* link;
link front=NULL;
link rear=NULL;
int enqueue(int value)
{
 link newnode;
 newnode=(link)malloc(sizeof(node));
 if (!newnode)
 {
	 printf("内存分配失败");
	 return -1;
 }
 newnode->data=value;
 newnode->next=NULL;
 if(rear==NULL)
 {
	 rear=newnode;
	 front=newnode;
 }
 else
 {
	 rear->next=newnode;
	 rear=newnode;
 }

}
int dequeue()
{   int temp;
    link top;
	if(front!=NULL)
	{  
		top=front;
      temp=top->data;
	  front=front->next;
	  free(top);
	  return temp;
      }
      return -1;
}
int main(int argc, char* argv[])
{   int loop=1;
    int select;
	int i_count=0;
	int o_count=0;
	int input[100];
    int output[100];
	int temp;
	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("队列已满");
			break;
		case 2:
			 if ((temp=dequeue())!=-1)
			 {
				 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;
}