先进后出,后进先出很重要!!!
1、栈的顺序存储结构
typedef struct
{
Elemtype *base;//栈底
ElemType *top;
int stackSize;
}sqStack;
2、创建栈`
#define STACK_INIT_SIZE 100
initStack(sqStack *s)
{
s->base = (ELemType*)malloc(STACK_INIT_SIZE *sizeof(ElemType));
if(!s->base)
exit;
s->top = s->base;
s->stackSize = STACK_INIT_SIZE;
}
3、栈的应用:中序表达式转换为逆序表达式
#include<stdio.h>
#include<stdlib.h>
#include<math.h>
#define STACK_INIT_SIZE 20
#define STACKINCREMENT 10
typedef char ElemType;
typedef struct
{
ElemType *base;
ElemType *top;
int stackSize;
}sqStack;
void InitStack(sqStack *s)//构造一个空栈s
{
s->base = (ElemType*)malloc(STACK_INIT_SIZE * sizeof(ElemType));
if(!s->base)
{
exit(OVERFLOW);
}
s->top = s->base;
s->stackSize = STACK_INIT_SIZE;
}
void Push(sqStack *s,ElemType e)//插入元素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;
s->top++;
}
void Pop(sqStack *s, ElemType *e)//如果栈不空,则删除栈s的栈顶元素,并用e返回其值
{
if( s->top == s->base )
{
return;
}
*e = *--(s->top);
}
int StackLen(sqStack s)//返回栈的长度
{
return(s.top - s.base);
}
int main()
{
sqStack s;
char c,e;
InitStack( &s );
printf("put and end #:");
scanf("%c",&c);
while(c != '#' )
{
while( c >= '0' && c <= '9' )
{
printf("%c",c);
scanf("%c",&c);
if( c < '0' || c > '9' )
{
printf(" ");
}
}
if(')' == c )
{
Pop(&s,&e);
while('(' != e)
{
printf("%c ", e);
Pop(&s,&e);
}
}
else if( '+'==c || '-' == c )
{
if(!StackLen(s))
{
Push(&s,c);
}
else
{
do
{
Pop(&s,&e);
if( '(' == e )
{
Push(&s,e);
}
else
{
printf("%c ",e);
}
}while( StackLen(s) && '('!=e );
Push(&s,c);
}
}
else if('*'==c || '/'==c || '('==c)
{
Push(&s,c);
}
else if( c=='#')
{
break;
}
else
{
printf("\n put error");
return -1;
}
scanf(" %c" , &c);
}
while(StackLen(s))
{
Pop(&s,&e);
printf("%c ",e);
}
return 0;
}