[Data Structure Primary][stack and queue]Rujia Liu-6.1.12-铁轨-栈和队列应用2

本文链接：https://blog.csdn.net/river_flows_in_you/article/details/8604944

（1）使用STL模板方法

///STL
#include<cstdio>
#include<stack>

using namespace std;
const int MAXN = 1000 + 10;

int n, target[MAXN];

int main(int argc, char** argv)
{
    while(scanf("%d", &n) == 1)
    {
        stack<int> s;
        int A = 1, B = 1;
        for(int i = 1; i <= n; i++)
        {
            scanf("%d", &target[i]);
        }
        int ok = 1;
        while(B <= n)
        {
            if(A == target[B])
                {
                    A++;
                    B++;
                }
            else if(!s.empty() && s.top() == target[B])
                {
                    s.pop();
                    B++;
                }
            else if(A <= n)
                s.push(A++);
            else
                {
                    ok = 0;
                    break;
                }
        }
        printf("%s\n", ok ? "Yes" : "No");

    }
    return 0;
}

（2）不使用STL，使用top栈顶指针和stack数组

///STL
#include<cstdio>
#include<stack>

using namespace std;
const int MAXN = 1000 + 10;

int n, target[MAXN];

int main(int argc, char** argv)
{
    while(scanf("%d", &n) == 1)
    {
        stack<int> s;
        int A = 1, B = 1;
        for(int i = 1; i <= n; i++)
        {
            scanf("%d", &target[i]);
        }
        int ok = 1;
        while(B <= n)
        {
            if(A == target[B])
                {
                    A++;
                    B++;
                }
            else if(!s.empty() && s.top() == target[B])
                {
                    s.pop();
                    B++;
                }
            else if(A <= n)
                s.push(A++);
            else
                {
                    ok = 0;
                    break;
                }
        }
        printf("%s\n", ok ? "Yes" : "No");

    }
    return 0;
}