#include<bits/stdc++.h>
#include <iostream>
using namespace std;
template <typename T>
class MyStack
{
public:
MyStack(int size);
~MyStack();
bool stackEmpty();//判空
bool stackFull();//判满
bool push(T elem);//压栈
bool pop(T &elem);//出栈
private:
T *m_pStack;//栈指针
int m_iSize;//栈容量
int m_iTop;//栈顶
};
template <typename T>
MyStack<T>::MyStack(int size)
{
m_iSize = size;
m_pStack = new T[m_iSize];
m_iTop = 0;
}
template <typename T>
MyStack<T>::~MyStack()
{
delete m_pStack;
m_pStack = NULL;
}
template <typename T>
bool MyStack<T>::stackEmpty() {//判空
return m_iTop == 0 ? true : false;
}
template <typename T>
bool MyStack<T>::stackFull() {//判满
return m_iTop == m_iSize ? true : false;
}
template <typename T>
bool MyStack<T>::push(T elem) {//压栈
if (stackFull()) {
return false;
}
else {
m_pStack[m_iTop++] = elem;
return true;
}
}
template <typename T>
bool MyStack<T>::pop(T &elem) {//出栈
if (stackEmpty())
{
return false;
}
else {
elem = m_pStack[--m_iTop];
return true;
}
}
int main(){
MyStack<Coordinate> *pStack = new MyStack<Coordinate>(5);
pStack->push(Coordinate(3, 5));//坐标点入栈
pStack->push(Coordinate(7, 5));
pStack->push(Coordinate(6, 5));
pStack->push(Coordinate(4, 5));
pStack->push(Coordinate(3, 5));
Coordinate t;
pStack->pop(t);//出栈
cout <<"弹出的t为:"<< t ;
if(!pStack->stackEmpty())
cout<<"not empty"<<endl;
if(!pStack->stackFull())
cout<<"not full"<<endl;
system("pause");
return 0;
}
【无标题】
最新推荐文章于 2024-07-04 11:10:43 发布