数据结构 --栈的实现

#ifndef STACK_H
#define STACK_H

#include "stdlib.h"
#define STACK_INIT_SIZE 100
#define STACKINCREMENT  10
#define OK 1
#define OVERFLOW  -2
#define Status  bool
#define TRUE  1
#define FALSE 0
#define ERROR 0

template <typename SElemType>
class SqStack
{
public:
	SElemType *base;
	SElemType *top;
	int stacksize;

    Status InitStack();
    Status DestroyStack();
    Status ClearStack();
	Status StackEmpty();
	Status Push(SElemType e);
	Status GetTop(SElemType &e);
	Status Pop(SElemType &e);
	int StackLength();
	Status StackTraverse(Status (* visit)(SElemType e));
};

template <typename SElemType>
Status SqStack<SElemType>::InitStack()
{
	base = (SElemType *)malloc(STACK_INIT_SIZE * sizeof(SElemType));
	if (!base)  exit(OVERFLOW);
    top = base;
	stacksize = STACK_INIT_SIZE;
	return OK;
}

template <typename SElemType>
Status SqStack<SElemType>::DestroyStack()
{
	free (base);
	base = top = NULL;
	return OK;
}

template <typename SElemType>
Status SqStack<SElemType>::ClearStack()
{
	top = base;
	return OK;
}

template <typename SElemType>
Status SqStack<SElemType>::StackEmpty()
{
	if (top == base)
	{
		return TRUE;
	}
	else
	{
		return FALSE;
	}
}

template <typename SElemType>
Status SqStack<SElemType>::Pop(SElemType &e)
{
	if (base == top)  return ERROR;
	e = *--top;
	return OK;
}

template <typename SElemType>
Status SqStack<SElemType>::Push(SElemType e)
{
	if (top - base >= stacksize)
	{
		base = (SElemType *)realloc(base, 
			(stacksize + STACKINCREMENT) * sizeof(SElemType));
		if (!base) exit(OVERFLOW);
		top = base + stacksize;
		stacksize += STACKINCREMENT;
	}
	*top ++ = e;
	return OK;
}

template <typename SElemType>
int SqStack<SElemType>::StackLength()
{
	return top - base;
}

template <typename SElemType>
Status SqStack<SElemType>::GetTop(SElemType &e)
{
	if (base == top) return ERROR;
	e = *(top - 1);
	return OK;
}

template <typename SElemType>
Status SqStack<SElemType>::StackTraverse(Status (* visit)(SElemType e))
{
	if (base == top) return ERROR;
	SElemType *pSElemType = top;
	while (base < pSElemType)
	{
		pSElemType --;
		visit(*pSElemType);
	}
	return OK;
}

#endif





















评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值