#include <stdio.h> 
#include <malloc.h> 
 
typedef int SElemType; 
typedef int Status; 
#define INIT_SIZE 100 
#define STACKINCREMENT 10 
#define Ok 1 
#define Error 0 
#define True 1 
#define False 0 
typedef struct 
{ 
  SElemType *base; 
  SElemType *top; 
  int stacksize; 
}SqStack; 
 
//初始化棧 
Status InitStack(SqStack *s) 
{ 
  s->base = (SElemType *)malloc(INIT_SIZE * sizeof(SElemType)); 
  if(!s->base) 
  { 
    puts("存儲空間分配失敗！"); 
    return Error; 
  } 
  s->top = s->base; 
  s->stacksize = INIT_SIZE; 
  return Ok; 
} 
 
//清空棧 
Status ClearStack(SqStack *s) 
 { 
  s->top = s->base; 
  return Ok; 
 } 
 
//棧是否為空 
Status StackEmpty(SqStack *s) 
 { 
  if(s->top == s->base) 
   return True; 
  else 
   return False; 
 } 
 
//銷毀棧 
Status Destroy(SqStack *s) 
{ 
  free(s->base); 
  s->base = NULL; 
  s->top = NULL; 
  s->stacksize=0; 
  return Ok; 
} 
 
//獲得棧頂元素 
Status GetTop(SqStack *s, SElemType &e) 
{ 
  if(s->top == s->base) return Error; 
  e = *(s->top - 1); 
  return Ok; 
} 
 
//壓棧 
Status Push(SqStack *s, SElemType e) 
{ 
  if(s->top - s->base >= s->stacksize)//棧滿 
  { 
    s->base = (SElemType *)realloc(s->base, (s->stacksize + STACKINCREMENT) * sizeof(SElemType)); 
    if(!s->base) 
    { 
      puts("存儲空間分配失敗！"); 
      return Error; 
    } 
    s->top = s->base + s->stacksize;//修改棧頂位置 
    s->stacksize += STACKINCREMENT;//修改棧長度 
 
  } 
  *s->top++ = e; 
  return Ok; 
} 
 
//彈棧 
Status Pop(SqStack *s, SElemType *e) 
{ 
  if(s->top == s->base) return Error; 
  --s->top; 
  *e = *(s->top); 
  return Ok; 
} 
 
//遍歷棧 
Status StackTraverse(SqStack *s,Status(*visit)(SElemType)) 
 { 
   SElemType *b = s->base;//此處不能直接用base或top移動，即不能改變原棧的結(jié)構(gòu) 
   SElemType *t = s->top; 
  while(t > b) 
   visit(*b++); 
  printf("\n"); 
  return Ok; 
 } 
 
Status visit(SElemType c) 
 { 
  printf("%d ",c); 
  return Ok; 
 } 

int main() 
{ 
  SqStack a; 
  SqStack *s = &a; 
  SElemType e; 
  InitStack(s); 
  int n; 
  puts("請輸入要進(jìn)棧的個(gè)數(shù)："); 
  scanf("%d", &n); 
  while(n--) 
  { 
    int m; 
    scanf("%d", &m); 
    Push(s, m); 
  } 
  StackTraverse(s, visit); 
  puts(""); 
  puts("8進(jìn)棧后："); 
  Push(s, 8); 
  StackTraverse(s, visit); 
  puts(""); 
  Pop(s, &e); 
  printf("出棧的元素是：%d\n", e); 
  printf("元素出棧后事實(shí)上并沒有清除，依然存在于內(nèi)存空間，所謂的出棧只是指針移動，出棧的元素是%d\n", *s->top);//判斷出棧后元素是否還存在于內(nèi)存中 
  Destroy(s); 
  return 0; 
}