C++栈实践

#include<iostream>


class SqStack
{
private:
enum{ MaxSize = 100 };
int data[MaxSize];
int top;
public:
SqStack();
~SqStack();
bool isEmpty();
void pushInt(int x);
int popInt();
int getTop();
int getMax();
void display();
};
SqStack::SqStack()
{
top = -1;
}
SqStack::~SqStack(){}
bool SqStack::isEmpty()//判断栈为空
{
return(top == -1);
}
void SqStack::pushInt(int x)//元素进栈
{
if (top == MaxSize - 1)
{
std::cout << "栈上溢出！" << std::endl;
}
else
{
++top;
data[top] = x;
}
}
int SqStack::popInt()//退栈
{
int tmp = 0;
if (top == -1)
{
std::cout << "栈已空！" << std::endl;
}
else
{
tmp = data[top--];
}
return tmp;
}
int SqStack::getTop()//获得栈顶元素
{
int tmp = 0;
if (top == -1)
{
std::cout << "栈空！" << std::endl;
}
else
{
tmp = data[top];
}
return tmp;
}
void SqStack::display()//打印栈里元素
{
std::cout << "栈中元素：" << std::endl;
for (int index = top; index >= 0; --index)
{
std::cout << data[index] << std::endl;
}
}
int SqStack::getMax()//获取最大值
{
int tmp = data[0];
for (int index = top; index > 0; --index)
{
if (data[index] > tmp)
{
tmp = data[index];
}
}
return tmp;
}
int main()
{
SqStack st;
std::cout << "栈空：" << st.isEmpty() << std::endl;
for (int i = 1; i<10; i++)
{
st.pushInt(i);
}
st.display();
std::cout<<"最大值："<<st.getMax()<<std::endl;
std::cout << "退一次栈" << std::endl;
st.popInt();
std::cout << "栈顶元素:" << st.getTop() << std::endl;
st.popInt();
st.display();
system("pause");
return 0;
}