function house.cpp

斐波那契数列

#include <iostream>
#include "declare.h"
//创建空的顺序栈
PSeqStack createEmptyStack_seq(int m)
{
	PSeqStack pastack=(PSeqStack)malloc(sizeof(struct SeqStack));
	if(pastack!=NULL)
	{
		pastack->s=(DataType *)malloc(sizeof(DataType)*m);
		if(pastack->s)
		{
			pastack->MAXNUM=m;
			pastack->t=-1;
			return pastack;
		}
		else free(pastack);
	}
	printf("Out of space!! \n");
	return NULL;
}

//判断顺序栈是否为空
int isEmptyStack_seq(PSeqStack pastack)
{
	return(pastack->t==-1);
}

//进栈
void push_seq(PSeqStack pastack,DataType x)
{
	if(pastack->t>=pastack->MAXNUM-1)
		printf("Overflow! \n");
	else
	{
		pastack->t=pastack->t+1;
		pastack->s[pastack->t]=x;
	}
}

//出栈
void pop_seq(PSeqStack pastack)
{
	if(pastack->t==-1)
		printf("Underflow! \n");
	else
		pastack->t=pastack->t-1;
}

//取栈顶元素
DataType top_seq(PSeqStack pastack)
{
	if(pastack->t==-1)
		printf("It is empty! \n");
	else
		return (pastack->s[pastack->t]);
}