Train Problem I

As the new term comes, the Ignatius Train Station is very busy nowadays. A lot of student want to get back to school by train(because the trains in the Ignatius Train Station is the fastest all over the world ^v^). But here comes a problem, there is only one railway where all the trains stop. So all the trains come in from one side and get out from the other side. For this problem, if train A gets into the railway first, and then train B gets into the railway before train A leaves, train A can't leave until train B leaves. The pictures below figure out the problem. Now the problem for you is, there are at most 9 trains in the station, all the trains has an ID(numbered from 1 to n), the trains get into the railway in an order O1, your task is to determine whether the trains can get out in an order O2.

代码如下：

#include <iostream>
#include <stack>        //提供 stack 容器，用于实现栈数据结构。
#include <string>
#include <vector>       //提供 vector 容器，用于存储目标序列。
using namespace std;

// 判断目标序列是否合法
void isValidTrainSequence(int n,string& O1, string& O2) {
    stack<char>s;                   //用于模拟车站的栈
    int index = 0;                  //用于进行下一个下标遍历
    vector<string>steps;            //使用动态储存，记录操作步骤；

    for(int i=0;i<n;i++){           //也可以使用for (char train : O1)
        s.push(O1[i]);              //按顺序入栈
        steps.emplace_back("in");   //显示步骤，在动态数据尾巴存储一个in ;

        //当栈顶为要出站的车时，出栈
        while (!s.empty() && s.top()==O2[index]){
            s.pop();
            steps.emplace_back("out");  //显示步骤，在动态数据尾巴存储一个out ;
            index++;                //找下一个元素
        }
    }

    //如果栈是空，说明可以按照指定顺序出栈；
    if(s.empty()){
        cout<<"Yes."<<endl;
        for(string& step :steps){
            cout<<step<<endl;
        }
    } else{
        cout<<"No."<<endl;
    }
    cout<<"FINISH"<<endl;
}

int main() {
    int n;
    string O1 , O2;
    while (cin >> n >> O1 >> O2) {
        isValidTrainSequence(n,O1,O2);
    }
    return 0;
}