栈的清空实现.doc

栈的清空实现void clear( SqStack &tem) int i=0; for(;iSTACKSIZE;i+) itemsi=0; top=0;#include .typedef.h #include using namespace std; #define STACK_INIT_SIZE 100 #define STACKINCREMENT 10 typedef int ElemType; typedef struct SqStack ElemType *top; ElemType *base; int stacksize; SqStack; status InitStack(SqStack*); status DestroyStack(SqStack*); status ClearStack(SqStack*); status StackEmpty(SqStack*); int StackLength(SqStack*); ElemType GetTop(SqStack*); status Push(SqStack*,ElemType); status pop(SqStack*,ElemType); int main() SqStack s; InitStack(&s); for(int i=0;i10;i+) Push(&s,i); ElemType top = GetTop(&s); coutstack top:topendl; int length = StackLength(&s); coutstack length:lengthbase = (ElemType*)malloc(STACK_INIT_SIZE)*sizeof(ElemType); if(!S-base) exit(ERROR); S-base = S-top; S-stacksize = STACK_INIT_SIZE; return OK; status DestroyStack(SqStack *S) free(S); return OK; status ClearStack(SqStack *S ) S-base = S-top; S-stacksize = 0; return OK; status StackEmpty(SqStack *S) if(S-stacksize!=0) return OK; else return ERROR; int StackLength(SqStack *S) return (S-stacksize); ElemType GetTop(SqStack *S) if(S-base = S-top) return ERROR; ElemType elem = *(S-top-1); return(elem); status Push(SqStack *S,ElemType elem) *(S-top-1) = elem; +S-top; +S-stacksize; return OK; status pop(SqStack *S,ElemType elem) -S-top; -S-stacksize; return OK; status InitStack(SqStack *S) S-base = (ElemType*)malloc(STACK_INIT_SIZE)*sizeof(ElemType); if(!S-base) exit(ERROR); S-base = S-top;/这里错了。改成S-top= S-base ； S-stacksize = STACK_INIT_SIZE; return OK; status Push(SqStack *S,ElemType elem) *(S-top-1) = elem;/这里压栈为什么要-1，应该不用，直接*(S-top+) = elem; +S-top;/改成我上面的这句就不用了。 +S-stacksize;/size也不用+1啊。 return OK; 然后这个函数就是缺少判断栈