用数组去模拟栈,利用malloc和realloc函数去增加数据的大小
//author:jwfy
//time:2014-1-13 pm 4:30
#include "stdafx.h"
#include <iostream>
#include <cstdlib>
#include <cstring>
#define ElemType int
using namespace std;
const int STACKSIZE = 3;
const int ADDSTACKSIZE = 10;
struct Stack
{
ElemType *top;
ElemType *base;
int size;
};
void Init(Stack& s)
{
s.base = (ElemType *) malloc(sizeof(ElemType)*STACKSIZE);
s.top=s.base;
s.size=STACKSIZE;
}
void Push(Stack& s,ElemType e)
{
if(s.top-s.base>=s.size)
{
s.base = (ElemType *) realloc(s.base,sizeof(ElemType)*(s.size+ADDSTACKSIZE));
s.top=s.base+s.size;
s.size+=ADDSTACKSIZE;
}
*s.top++=e;
}
void Pop(Stack&s,ElemType& e)
{
if(s.base==s.top)
return ;
s.top--;
e=*s.top;
}
void GetTop(Stack s,ElemType& e)
{
if(s.base==s.top)
return ;
s.top--;
e=*s.top;
}
int main()
{
Stack stack;
ElemType e;
Init(stack);
Push(stack,1);
Push(stack,2);
Push(stack,3);
Push(stack,4);
GetTop(stack,e);
cout<<e<<endl;
Pop(stack,e);
cout<<e<<endl;
GetTop(stack,e);
cout<<e<<endl;
Pop(stack,e);
cout<<e<<endl;
GetTop(stack,e);
cout<<e<<endl;
Pop(stack,e);
cout<<e<<endl;
Pop(stack,e);
cout<<e<<endl;
return 0;
}