数据结构--栈（C++）

最新推荐文章于 2024-07-18 11:15:35 发布

期待┌;崛起、~~

最新推荐文章于 2024-07-18 11:15:35 发布

阅读量186

点赞数

分类专栏：数据结构--C++实现代码

本文链接：https://blog.csdn.net/gjpzl/article/details/79233989

版权

数据结构--C++实现代码专栏收录该内容

12 篇文章 0 订阅

订阅专栏

本文介绍了如何使用C++实现一个自定义的栈数据结构，包括构造函数、析构函数、判断栈空、栈满、清空栈、获取栈长度、元素入栈、出栈及遍历栈元素等功能。示例代码展示了栈的基本操作和使用。

摘要由CSDN通过智能技术生成

//MyStack.h

#ifndef MYSTACK_H
#define MYSTACK_H

class MyStack
{
    public:
        MyStack(int size);
        ~MyStack();
        bool stackEmpty();
        bool stackFull();
        void clearStack();
        int stackLength();
        bool push(char elem);
        bool pop(char &elem);
        void stackTraverse(bool isFromButtom);
    private:
        char *m_pBuffer;
        int m_iSize;
        int m_iTop;

};

#endif // MYSTACK_H

//MyStack.cpp

#include "MyStack.h"
#include <iostream>
using namespace std;

MyStack::MyStack(int size)
{
   m_iSize = size;
   m_pBuffer = new char[size];
   m_iTop = 0;
}

MyStack::~MyStack()
{
    delete []m_pBuffer;
}
bool MyStack::stackEmpty()
{
    if(0==m_iTop) //if(m_iTop == 0)
    {
        return true;
    }
    return false;
}

bool MyStack::stackFull()
{
    if(m_iTop == m_iSize) //>=
    {
        return true;
    }
    return false;
}

void MyStack::clearStack()
{
    m_iTop = 0;
}
int MyStack::stackLength()
{
    return m_iTop;
}

bool MyStack::push(char elem)
{
    if(stackFull())
    {
        return false;
    }
    m_pBuffer[m_iTop] = elem;
    m_iTop++;
    return true;
}
/*char MyStack::pop()
{
    if(stackEmpty())
    {
        throw 1;
    }
    else
    {
        m_iTop--;
        return m_pBuffer[m_iTop];
    }
}*/
bool MyStack::pop(char &elem)
{
    if(stackEmpty())
    {
        return false;
    }
    m_iTop--;
    elem = m_pBuffer[m_iTop];
    return true;
}
void MyStack::stackTraverse(bool isFromButtom)
{
    if(isFromButtom){
        for(int i = 0;i<m_iTop;i++)
        {
            cout<<m_pBuffer[i]<<",";
        }
    }else{
        for(int i= m_iTop-1;i>=0;i--)
        {
            cout<<m_pBuffer[i]<<",";
        }
    }
}

//main.cpp

#include <iostream>
#include "MyStack.h"
using namespace std;

int main()
{
    MyStack *pStack = new MyStack(5);
    pStack->push('h');
    pStack->push('e');
    pStack->push('l');
    pStack->push('l');
    pStack->push('o');
    pStack->stackTraverse(false);
    char elem = 0;
    pStack->pop(elem);
    cout<<endl;
    cout<<elem<<endl;
   //pStack->clearStack();
    cout<<endl;
    cout<<pStack->stackLength()<<endl;
    if(pStack->stackEmpty())
    {
        cout<<"栈为空"<<endl;
    }
    if(pStack->stackFull())
    {
        cout<<"栈为满"<<endl;
    }
    delete pStack;
    pStack = NULL;
    return 0;
}