（C语言）栈实现队列元素逆置-洋葱先生-杨少通

注：本程序由Visual Studio 2015编写，与VC++6.0稍有区别，复制到VC++6.0注释掉“#include “stdafx.h””即可运行，复制到VS可直接运行。

#include "stdafx.h"

#include <stdio.h>

#include <iostream>

using namespace std;

#define OK 1

#define ERROR 0

#define OVERFLOW -1

#define UNDERFLOW -2

#define STACK_INIT_SIZE 80

#define STACKINCREMENT 10

typedef int status;

#define ElemType char

typedef struct {

	ElemType *base;

	ElemType *top;

	int stacksize;

}SqStack;

SqStack S;

#define MAXQSIZE 80

typedef struct {

	ElemType *base;

	int front;

	int rear;

}SqQueue;

SqQueue Q;

status InitStack(SqStack &S)  //初始化栈

{

	S.base = (ElemType*)malloc(STACK_INIT_SIZE * sizeof(ElemType));

	if (!S.base)exit(OVERFLOW);

	S.top = S.base;

	S.stacksize = STACK_INIT_SIZE;

	return OK;

}

status InitQueue(SqQueue &Q) {  //初始化队列

	Q.base = (ElemType*)malloc(MAXQSIZE * sizeof(ElemType));

	if (!Q.base)exit(OVERFLOW);

	Q.front = Q.rear = 0;

	return OK;

}

status Push(SqStack &S, ElemType e) {//入栈

	if (S.top-S.base == S.stacksize) {

		S.base = (ElemType*)realloc(S.base, (S.stacksize + STACKINCREMENT) * sizeof(ElemType));

		if (!S.base)exit(OVERFLOW);

		S.top = S.base + S.stacksize;

		S.stacksize += STACKINCREMENT;

	}

	*S.top++ = e;

	return OK;

}

status EnQueue(SqQueue &Q, ElemType e) {  //入队

	if ((Q.rear + 1) % MAXQSIZE == Q.front)

		return ERROR;//队满

	Q.base[Q.rear] = e;

	Q.rear = (Q.rear + 1) % MAXQSIZE;

	return OK;

}

status Pop(SqStack &S, ElemType &e) {//出栈

	if (S.top == S.base)exit(UNDERFLOW);

	e = *(S.top=S.top-1);

	return OK;

}

status DeQueue(SqQueue &Q, ElemType &e) { //出队

	if (Q.front == Q.rear)return ERROR; //队空

	e = Q.base[Q.front];

	Q.front = (Q.front + 1) % MAXQSIZE;

	return OK;

}

status StackEmpty(SqStack S) {//是否为空栈

	return S.base == S.top;

}

status QueueEmpty(SqQueue Q) {//是否为空队

	return Q.rear == Q.front;

}

void algo(SqQueue &Q) {//栈实现队的首尾逆置

	ElemType e;

	InitStack(S);

	cout << "   栈逆置队列前元素如下：";

	while (!QueueEmpty(Q)) {

		DeQueue(Q, e);

		cout << e;

		Push(S, e);

	}

	cout << endl;

	while (!StackEmpty(S)) {

		Pop(S, e);

		EnQueue(Q, e);

	}

}

int main() {

	InitQueue(Q);

	ElemType e;

	int num;

	cout << "\t\t\t\t*\t\t\t\t\t*";

	cout << endl << "\t\t\t\t*\t计科1512-02210151232-杨少通\t*" << endl;

	cout << "\t\t\t\t*****************************************" << endl << endl;

	cout << "****************栈逆置队列元素****************" << endl << endl;

	cout << "   请输入初始化队列元素个数:";

	cin >> num;

	for (int i = 0; i < num; i++) {

		cout << "   请输入第" << i + 1 << "个元素:";

		cin >> e;

		EnQueue(Q, e);

	}

	algo(Q);

	cout << "   栈逆置队列后元素如下：";

	while (!QueueEmpty(Q))

	{

		DeQueue(Q, e);

		cout << e;

	}

	cout << endl << endl;

	return 0;

}

如有转载请注明来源： www.dreamload.cn/blog/?p=251&preview=true （洋葱先生）