数据结构学习日记（2）——用栈实现括号匹配

最新推荐文章于 2024-03-05 11:17:58 发布

Hcm_Scu

最新推荐文章于 2024-03-05 11:17:58 发布

阅读量244

点赞数

分类专栏：算法数据结构学习日记文章标签：栈数据结构

本文链接：https://blog.csdn.net/hcm6666666/article/details/78159689

版权

算法数据结构学习日记专栏收录该内容

8 篇文章 0 订阅

订阅专栏

关于怎么用代码写一个栈可以看我的数据结构学习日记（1），这里就用那里写下的栈来作为栈类型

#include "MyStack.h"
#include <iostream>
using namespace std;
int main()
{       
    MyStack<char> *pstack = new MyStack<char>(40);
    MyStack<char> *NeedPstack = new MyStack<char>(40);
    char str[] = "[()]}";
    char currentNeed = NULL;
    for (int i(0); i < strlen(str); ++i)
    {
        if (str[i] != currentNeed)
        {
            pstack->push(str[i]);
            switch (str[i])
            {
            case '[':
                if (currentNeed != 0)
                {
                    NeedPstack->push(currentNeed);
                }
                currentNeed = ']';
                break;
            case '{':
                if (currentNeed != 0)
                {
                    NeedPstack->push(currentNeed);
                }
                currentNeed = '}';
                break;
            case '(':
                if (currentNeed != 0)
                {
                    NeedPstack->push(currentNeed);
                }
                currentNeed = ')';
                break;
            default:
                cout << "不匹配" << endl;
                system("pause");
                return 0;               
            }
        }
        else
        {
            char elem;
            pstack->pop(elem);
            if (!NeedPstack->pop(currentNeed))
            {
                currentNeed=NULL;
            }
        }

    }
    if (pstack->stackEmpty())
    {
        cout << "匹配" << endl;
    }
    else
        cout << "不匹配" << endl;
    delete pstack;
    delete NeedPstack;
    pstack = NULL;
    system("pause");
    return 0;
}