POJ-1028(Web Navigation)

最新推荐文章于 2022-03-11 14:41:23 发布

YancyKahn

最新推荐文章于 2022-03-11 14:41:23 发布

阅读量357

点赞数

分类专栏：模拟

本文链接：https://blog.csdn.net/qq_37753409/article/details/79180487

版权

模拟专栏收录该内容

4 篇文章 0 订阅

订阅专栏

POJ-1028

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <stack>

using namespace std;
const char VISIT[] = "VISIT";
const char BACK[] = "BACK";
const char FORWARD[] = "FORWARD";
const char QUIT[] = "QUIT";

stack<string> Stack1, Stack2;
char cmd[10];
string web;

void init()
{
    while(!Stack2.empty()) Stack2.pop();
}
int main()
{
    Stack1.push("http://www.acm.org/");
    while(cin >> cmd)
    {
        if(strcmp(cmd, QUIT) == 0) break;
        else if(strcmp(cmd, VISIT) == 0){
            cin >> web;
            Stack1.push(web);
            cout << web <<endl;
            init();
        }else if(strcmp(cmd, BACK) == 0)
        {
            if(Stack1.size() > 1)
            {
                Stack2.push(Stack1.top());
                Stack1.pop();
                cout << Stack1.top() <<endl;

            }else
                cout << "Ignored" <<endl;
        }else if(strcmp(cmd, FORWARD) == 0)
        {
            if(!Stack2.empty())
            {
                Stack1.push(Stack2.top());
                cout << Stack2.top() << endl;
                Stack2.pop();
            }else
                cout << "Ignored" <<endl;
        }
    }
}