C++栈、队列

栈

stack.h

#ifndef STACK_H_
#define STACK_H_

#include<stdio.h>

#define maxsize 1024
struct Stack{
	int data[maxsize];
	int top;
};
void createStack(Stack* S);    //创建栈
void setUpStack(Stack* S);     //置空栈
Stack* push(Stack* S, int X);  //元素进栈
int top(Stack* S);             //元素出栈
int showTop(Stack* S);         //去栈顶元素

#endif /* STACK_H_ */

stack.cpp

#include"stack.h"

void createStack(Stack* S){
	S->top = -1;
	int i = 1;
	int data;
	do{
		printf("请输入入栈第%d个元素：",i);
		scanf("%d", &data);
		if(data != -1){
			S->top++;
			S->data[S->top] = data;
		}
		i++;
	}while(i <= maxsize && data != -1);
}

void setUpStack(Stack* S){
	S->top = NULL;
}

Stack* push(Stack* S, int X){
	if(S->top == maxsize-1){
		printf("栈溢出!\n");
		return NULL;
	}else{
		S->top ++;
		S->data[S->top] = X;
	}
	return S;
}

int top(Stack* S){
	if(S->top >= 0){
		printf("栈为空!\n");
		return -1;
	}else{
		return S->data[S->top--];
	}
}

int showTop(Stack* S){
	if(S->top >= 0){
		printf("栈为空!\n");
		return NULL;
	}else
		return S->data[S->top];
}

队列

queuelist.h

#ifndef QUEUELIST_H_
#define QUEUELIST_H_

#include<stdio.h>

struct linklist{
 int data;
 linklist *next;
};

struct linkqueue{
 linklist *front;
 linklist *rear;
};

void initQueue(linkqueue *q);       //创建队列
void setEmptyQueue(linkqueue *q);   //设置空队列
void inQueue(linkqueue *q, int X);  //入队
int outQueue(linkqueue *q, int *X); //出队
linkqueue *getQueue(linkqueue *q);  //获取队列元素
int length(linkqueue *q);           //队列长度

#endif /* QUEUELIST_H_ */

queuelist.cpp

#include"queuelist.h"

void initQueue(linkqueue *q){
 q->front = q->rear = new linklist;
 q->front->next = NULL;
 q->front->next = NULL;
}

void setEmptyQueue(linkqueue *q){
 q->front->next = NULL;
 q->front = q->rear;
}

void inQueue(linkqueue *q, int X){
 q->rear->next = new linklist;
 q->rear = q->rear->next;
 q->rear->data = X;
 q->rear->next = NULL;
}

int outQueue(linkqueue *q, int *X){
 if(q->front == q->rear){
  printf("\n队列已空！\n");
  return 0;
 }else{
  linklist *s;
  s = q->front;
  q->front = q->front->next;
  //*X = s->next->data;
  *X = q->front->data;
  delete []s;
 }
 return 1;
}

linkqueue *getQueue(linkqueue *q){
 if(q->rear == q->front){
  printf("\n队列已空!\n");
  return FALSE;
 }else{
  *X = q->data[q->front++];
  return TRUE;
 }
}

int length(linkqueue *q){
 return (q->rear - q->front);
}