数据结构-顺序栈

栈的简介和特点

栈是限制在一端进行操作的线性表，允许进行操作的一端称
为栈顶，另一端为栈底，栈中没有元素时称为空栈。
逻辑结构：1对1的线性表
存储结构：顺序存储->顺序栈
         链式存储->链式栈
 常见操作：入栈、出栈
特点：后进先出（LIFO，LAST IN FIRST OUT）

顺序栈的实现

顺序栈的定义

#define N 20

//定义一种数据类型
typedef int data_type;

//栈的定义
typedef struct stack
{
	data_type arr[N]; //数据
	int top; //记录栈中数据的个数。top == -1，栈空，top == N - 1,栈满
}Stack;

创建栈

Stack *CreatStack(void)
{
	Stack *pStack = (Stack *)malloc(sizeof(Stack));
	if(NULL == pStack)
	{
		return NULL;
	}
	memset(pStack,0,sizeof(Stack));
	pStack->top = -1;//栈空
	return pStack;
}

入栈

int InsertStack(Stack *pStack,data_type item)
{
	if(NULL == pStack)
	{
		return STACKNULL;
	}
	if(pStack->top == N-1)
	{
		return STACKFULL;
	}
	//栈未满，开始插入
	pStack->top++;
	pStack->arr[pStack->top] = item;
	return OK;
}

出栈

int OutStack(Stack *pStack)
{
	if(NULL == pStack)
	{
		return STACKNULL;
	}
	if(pStack->top == -1)
	{
		return STACKEMPTY;
	}
	//不是空栈，开始进行出栈
	//pStack->arr[pStack->top] = 0,对要删除的栈进行操作
	pStack->top--;
	return OK;
}

显示

int ShowStack(Stack *pStack)
{
	if(NULL == pStack)
	{
		return STACKNULL;
	}
	if(pStack->top == -1)
	{
		return STACKEMPTY;
	}
	//有元素开始显示
	int i = 0;
	for(i = 0;i <= pStack->top;i++)
	{
		printf("%d ",pStack->arr[i]);
	}
	return OK;
}

全部代码

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#define N 20

//定义一种数据类型
typedef int data_type;

//栈的定义
typedef struct stack
{
	data_type arr[N]; //数据
	int top; //记录栈中数据的个数。top == -1，栈空，top == N - 1,栈满
}Stack;

//枚举，返回值
enum ret
{
	MALLOCERROR = -4,
	STACKNULL,
	STACKEMPTY,
	STACKFULL,
	OK,
};

//菜单
void menu(void);

//创建栈
Stack *CreatStack(void);


//入栈
int InsertStack(Stack *pStack,data_type item);

//出栈
int OutStack(Stack *pStack);

//显示
int ShowStack(Stack *pStack);

//主函数
int main(int argc, const char *argv[])
{
	int op;
	Stack *pStack = CreatStack();
	data_type item;
	while(1)
	{
		menu();
		printf("input your op:");
		scanf("%d",&op);
		if(-1 == op)
			break;
		switch(op)
		{
			case 1:
				{
					printf("intput item:");
					scanf("%d",&item);
					InsertStack(pStack,item);
					break;
				}
			case 2:
				{
					OutStack(pStack);
					break;
				}
			case 3:
				{
					ShowStack(pStack);
					break;
				}
		}
	}
	return 0;
}

//---------------子函数的实现-------------------------

//菜单
void menu(void)
{
	printf("****************\n");
	printf("*1.insert*******\n");
	printf("*2.out**********\n");
	printf("*3.show*********\n");
	printf("*-1.exit********\n");
	printf("****************\n");
}

//创建栈
Stack *CreatStack(void)
{
	Stack *pStack = (Stack *)malloc(sizeof(Stack));
	if(NULL == pStack)
	{
		return NULL;
	}
	memset(pStack,0,sizeof(Stack));
	pStack->top = -1;//栈空
	return pStack;
}

//入栈
int InsertStack(Stack *pStack,data_type item)
{
	if(NULL == pStack)
	{
		return STACKNULL;
	}
	if(pStack->top == N-1)
	{
		return STACKFULL;
	}
	//栈未满，开始插入
	pStack->top++;
	pStack->arr[pStack->top] = item;
	return OK;
}

//出栈
int OutStack(Stack *pStack)
{
	if(NULL == pStack)
	{
		return STACKNULL;
	}
	if(pStack->top == -1)
	{
		return STACKEMPTY;
	}
	//不是空栈，开始进行出栈
	//pStack->arr[pStack->top] = 0,对要删除的栈进行操作
	pStack->top--;
	return OK;
}

//显示
int ShowStack(Stack *pStack)
{
	if(NULL == pStack)
	{
		return STACKNULL;
	}
	if(pStack->top == -1)
	{
		return STACKEMPTY;
	}
	//有元素开始显示
	int i = 0;
	for(i = 0;i <= pStack->top;i++)
	{
		printf("%d ",pStack->arr[i]);
	}
	return OK;
}