HDU1022 Train Problem I(栈)

最新推荐文章于 2022-03-12 15:07:20 发布

_Botton

最新推荐文章于 2022-03-12 15:07:20 发布

阅读量66

点赞数

分类专栏：题解

本文链接：https://blog.csdn.net/m0_51560548/article/details/115829732

版权

题解专栏收录该内容

80 篇文章 0 订阅

订阅专栏

题目链接
测试数据:
5 12342 24321
Yes.
in
in
out
in
in
out
out
in
out
out
FINISH

6 123456 215436
Yes.
in
in
out
out
in
in
in
out
out
out
in
out
FINISH

这两组数据要是都能过的话基本上没问题
遇到的小问题:
使用string类型要导入 srting
清空vector可以直接用.clear()
AC代码

#include <iostream>
#include <string>
#include <vector>
#include <stack>

using namespace std;

int n;
vector<int> in,out;
vector<string> ptf;
stack<int> tmp;

int main()
{
    while(cin >> n)
    {
        in.clear();
        out.clear();
        ptf.clear();
        while(!tmp.empty())
        {
            tmp.pop();
        }
        for(int i = 0; i < n;)
        {
            char tmp;
            cin >> tmp;
            if(tmp >= '0' && tmp <= '9')
            {
                in.push_back(tmp-'0');
                i++;
            }
        }
        for(int i = 0; i < n;)
        {
            char tmp;
            cin >> tmp;
            if(tmp >= '0' && tmp <= '9')
            {
                out.push_back(tmp-'0');
                i++;
            }
        }
        int i = 0;
        int j = 0;
        while(i < in.size())
        {
            tmp.push(in[i]);
            i++;
            ptf.push_back("in");
            while(!tmp.empty() && tmp.top()==out[j])
            {
                ptf.push_back("out");
                tmp.pop();
                if(j+1==out.size())
                {
                    j++;
                    break;
                }
                j++;
            }
        }

        if(tmp.empty())
        {
            cout << "Yes." << endl;
            while(!ptf.empty())
            {
                cout << ptf.front() << endl;
                ptf.erase(ptf.begin());
            }

        }
        else
        {
            cout << "No." << endl;
        }
        cout << "FINISH" << endl;
    }
    return 0;
}