栈和队列

栈

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

#define size 100
typedef char DataType;
typedef struct{
	DataType data[size];
	int top;
}stack;

//置空栈
void initStack(stack * s){
	s->top=-1;
}

//判栈空
int StackEmpty(stack * s){
	return s->top==-1;
}

int StackFull(stack * s){
	return s->top==size;
}

void Push(stack * s,DataType x){
	if(StackFull(s)){
		printf("%s\n", "overflow");
	}else{
		s->top=s->top+1;
		s->data[s->top]=x;
	}
}

DataType Pop(stack *s){
	if(StackEmpty(s)){
		exit(0);
	}
	return s->data[s->top--];
}


int main(int argc,char ** argv){
	stack  stack;
	initStack(&stack);
	for (int i = 0; i < 100; ++i)
	{
		Push(&stack,i);
	}

	printf("%c\n", Pop(&stack));

	return 0;
}

队列

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

#define size 100
typedef char DataType;

typedef struct {
	DataType data[size];
	int front,rear;
}Queue;

void InitQueue(Queue * q){
	q->front=0;
	q->rear=0;
}

int QueueEmpty(Queue * q){
	return q->rear==q->front;
}

int QueueFull(Queue *q){
	return (q->rear+1) % size==q->front;
}

//入队
void Insert(Queue * q,DataType x){
	if(QueueFull(q)){
		printf("%s\n", "error");
	}else{
		q->data[q->rear]=x;
		q->rear=(q->rear+1) % size;
	}
}

DataType GetFront(Queue *q){
	if(QueueEmpty(q)){
		printf("%s\n","error" );
		exit(0);
	}

	return q->data[q->front];
}

DataType OutQueue(Queue * q){
	DataType x;
	if(QueueEmpty(q)){
		printf("%s\n","error" );
	}else{
		x=q->data[q->front];
		q->front = (q->front+1) % size;
		return x;
	}
	return 0;
}

int main(int argc,char ** argv){
	Queue q;
	InitQueue(&q);
	Insert(&q,'a');
	Insert(&q,'b');
	Insert(&q,'c');
	printf("%c\n", GetFront(&q));
	printf("%c\n", OutQueue(&q));
	return 0;
}