ss.cpp

数据结构中所有算法的实现

#include "d:\cpp\head.h"
#define INIT_SIZE 100
#define INCREMENT 10
typedef char ElemType;
typedef struct{
  ElemType *base;
  ElemType *top;
  int stacksize;
}SqStack;
Status InitStack(SqStack &S){
  S.base=(ElemType*)malloc(INIT_SIZE*sizeof(ElemType));
  if(!S.base)exit(OVERFLOW);
  S.top=S.base;
  S.stacksize=INIT_SIZE;
  return OK;
}
Status Push(SqStack &S,ElemType e){
  if(S.top-S.base>=S.stacksize){
    S.base=(ElemType*)realloc(S.base,(S.stacksize+INCREMENT)*sizeof(ElemType));
    if(!S.base)exit(OVERFLOW);
    S.top=S.base+S.stacksize;
    S.stacksize+=INCREMENT;
  }
  *S.top=e;
  S.top++;
  return OK;
}
Status Pop(SqStack &S,ElemType &e){
  if(S.top==S.base)return ERROR;
  S.top--;
  e=*S.top;
  return OK;
}
Status GetTop(SqStack &S,ElemType &e){
  if(S.top==S.base)return ERROR;
  e=*(S.top-1);
  return OK;
}
Bool StackEmpty(SqStack S){
  if(S.top==S.base)return TRUE;
  else return FALSE;

}