数据结构：栈的实现

cxx0739

于 2012-05-31 16:05:09 发布

阅读量273

点赞数

CC 4.0 BY-SA版权

文章标签：数据结构

本文链接：https://blog.youkuaiyun.com/cxx0739/article/details/7620154

past 专栏收录该内容

5 篇文章

订阅专栏

本文详细介绍了 C++ 中栈的基本实现方式，包括构造、判断空栈、判断满栈、入栈、出栈、获取栈顶元素及弹出栈顶元素的操作。通过实例演示了如何使用数组来实现栈，并提供了相应的输入输出流程。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

using namespace std;
class Stack
{
private:
int maxSize;
int top;
int theArray[100];

public:
Stack(int capacity)
{
maxSize = capacity;
top = -1;
int x;
cin>>x;
int i = 0;
while(x != 0)
{
theArray[++top] = x;
cin>>x;
}
}

bool isEmpty()
{
return top == -1;
}

bool isFull()
{
return top == maxSize - 1;
}

void push(int x)
{
if(isFull())
cout<<"push failed,the stack is full"<<endl;
else
{
theArray[++top] = x;
}
}

void pop()
{
if(isEmpty())
cout<<"pop failed,the stack is empty"<<endl;
else
{
top--;
}
}

int topAndPop()
{
if(isEmpty())
cout<<"top and pop failed,the stack is empty"<<endl;
else
{
return theArray[top - 1];
top--;
}
}

int Top()
{
if(isEmpty())
cout<<"top failed,the stack is empty"<<endl;
else
return theArray[top];
}

void outputStack()
{
if(isEmpty())
cout<<"output failed,the stack is empty"<<endl;
else
{
for(int i = 0;i <= top;i ++)
{
cout<<theArray[i]<<" ";
}
}
}
};