[数据结构与算法]数据结构-两栈空间顺序栈表示

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

//两栈共享
//两个栈空间在一个数组里
//栈1头=-1,栈2头 = MAX_SIZE

const int MAX_SIZE = 10;
typedef int DataType;
typedef struct
{
	DataType data[MAX_SIZE];
	int top1;
	int top2;
}BothStack;

void Initial(BothStack* bs);
void push(BothStack* bs, int i, DataType x);
DataType pull(BothStack* bs, int i);
void print(BothStack* bs, int i);

int main()
{
	BothStack bs;
	Initial(&bs);
	push(&bs, 2, 2);
	print(&bs, 2);
	push(&bs, 2, 3);
	print(&bs, 2);
	system("pause");
	return 0;
}

void Initial(BothStack* bs)
{
	//空栈
	bs->top1 = -1;
	bs->top2 = MAX_SIZE;
}

void push(BothStack* bs, int i, DataType x)
{
	//判断栈满
	if (bs->top1 + 1 == bs->top2)
	{
		printf("栈已满\n");
	}
	else
	{
		//执行栈1入栈
		if (1 == i)
		{
			bs->top1++;
			bs->data[bs->top1] = x;
			printf("栈1插入成功!\n");
		}
		else if (2 == i)
		{
			bs->top2--;
			bs->data[bs->top2] = x;
			printf("栈2插入成功!\n");
		}
		else
		{
			printf("请输入正确的栈标号!\n");
		}
	}
	return;
}

DataType pull(BothStack* bs, int i)
{
	DataType x;
	//分别判断两栈元素是否为空
	//1栈
	if (1 == i)
	{
		if (bs->top1 == -1)
		{
			printf("栈1为空\n");
		}
		else
		{
			x = bs->data[bs->top1];
			bs->top1--;
		}
	}
	else if (2 == i)
	{
		if (bs->top2 == MAX_SIZE)
		{
			printf("栈2为空!\n");
		}
		else
		{
			x = bs->data[bs->top2];
			bs->top2++;
		}
	}
	else
	{
		printf("请输入正确的栈标号!\n");
	}
	return x;
}

//遍历
void print(BothStack* bs, int i)
{
	//判断栈号
	if (1 == i)
	{
		//栈1是否为空栈
		if (bs->top1 == -1)
		{
			printf("栈1为空栈，不可遍历!\n");
		}
		else
		{
			while (bs->top1 != -1)
			{
				//根据栈的特点，后进先出
				printf("%d\n", bs->data[bs->top1]);
				bs->top1--;
			}
		}
	}
	else
	{
		//栈2是否为空栈
		if (bs->top2 == MAX_SIZE)
		{
			printf("栈2为空栈，不可遍历!\n");
		}
		else
		{
			while (bs->top2 != MAX_SIZE)
			{
				//根据栈的特点，后进先出
				printf("%d\n", bs->data[bs->top2]);
				bs->top2++;
			}
		}
	}
}