Ò»¸östackµÄÀý×Ó£¬²»ÖªµÀÔõôpush Ò»¸öÊý

»Ý¶ùÓêµã

#include<iostream>
using namespace std;

template<class T>
class Stack
{
private:
int top;
int MaxTop;
T *stack;
public:
Stack(int MaxStackSize);
~Stack(){delete[] stack;}
int IsEmpty()const {return (top==-1)?1:0;}
int IsFull()const {return (top==MaxTop)?0:1;}
T Top();
Stack<T>&Add(const T&x);
Stack<T>&Delete(T&x);
};

template<class T>
Stack<T>::Stack(int MaxStackSize)
{
MaxTop=MaxStackSize-1;
stack=new T [MaxStackSize];
for(int i=0;i<=MaxTop;i++)
{
stack[i]= 0;
}
top=-1;
}
template<class T>
T Stack<T>::Top()
{
if(IsEmpty())
{
cout<<"empty";
exit(1);
}
else
{
return stack[top--];
}

}
template<class T>
Stack<T>&Stack<T>::Add(const T &x)
{
if(IsFull)
{
cout<<"Full";
exit(1);
}
Stack[++top]=x;
return *this;
}
template<class T>
Stack<T>&Stack<T>::Delete(T &x)
{
if(IsEmpty)
{
cout<<"empty";
exit(1);
}
x=stack[top--];
return *this;
}
int main()
{
Stack <int> S(10);
int i=S.Top();
cout<<i<<endl;
return 1;
}


Ôõô²ÅÄÜpushÒ»¸öÊý°¡ £¬ÎÒÓÃS.Add(1);²»Ðа¡

ÌÙÌ}ϵÄê–¹â

Stack<T>&Stack<T>::Add(const T &x)//&ÓÐʲôÓÃ???±ð˵¿ì°¡,¶¼ÊÇÄÚÖõÄ
{
if(IsFull())//()
{
cout<<"Full";
exit(1);
}
Stack[++top]=x;
return *this;
}
template<class T>
Stack<T>&Stack<T>::Delete(T &x)
{
if(IsEmpty())
{
cout<<"empty";
exit(1);
}
x=stack[top--];
return *this;
}
ÁíÍâ,ÄãµÄDelete ÓкܴóµÄÎÊÌâ°É????
²»»áÊÇÏëÈÃÒ»¸ö±äÁ¿À´±£´ædeleteµÄÖµ°É??
Ì«ÄÑÀí½âÁË ²»ÈçÖ±½Ó·µ»Øɾ³ýµÄ±äÁ¿µÄÖµÄØ
return stack[top--];

ûÐÄû·Î

Èý¸öµØ·½´íÁË..
#include<iostream>
using namespace std;

template<class T>
class Stack
{
private:
int top;
int MaxTop;
T *stack;
public:
Stack(int MaxStackSize);
~Stack(){delete[] stack;}
int IsEmpty()const {return (top==-1)?1:0;}
int IsFull()const {return (top!=MaxTop)?0:1;}
T Top();
Stack<T>&Add(const T&x);
Stack<T>&Delete(T&x);
};

template<class T>
Stack<T>::Stack(int MaxStackSize)
{
MaxTop=MaxStackSize-1;
stack=new T [MaxStackSize];
for(int i=0;i<=MaxTop;i++)
{
stack[i]= 0;
}
top=-1;
}
template<class T>
T Stack<T>::Top()
{
if(IsEmpty())
{
cout<<"empty";
exit(1);
}
else
{
return stack[top--];
}

}
template<class T>
Stack<T>&Stack<T>::Add(const T &x)
{
if(IsFull())
{
cout<<"Full";
exit(1);
}
stack[++top]=x;
return *this;
}
template<class T>
Stack<T>&Stack<T>::Delete(T &x)
{
if(IsEmpty)
{
cout<<"empty";
exit(1);
}
x=stack[top--];
return *this;
}
int main()
{
Stack <int> S(10);
S.Add(1);
int i=S.Top();
cout<<i<<endl;
return 0;
}