【栈】POJ 1028 Web Navigation

最新推荐文章于 2024-11-01 15:38:20 发布

weixin_33749131

最新推荐文章于 2024-11-01 15:38:20 发布

阅读量75

点赞数

CC 4.0 BY-SA版权

原文链接：https://my.oschina.net/lee24/blog/74471

本文探讨了80%的程序员难以成为架构师的原因，通过模拟浏览器操作，利用栈结构实现前进和后退功能，深入解析了编程与架构之间的关键区别。

为什么80%的码农都做不了架构师？>>>

模拟题目所述的浏览器的各种操作，使用一个curWebsite变量来保存当前的Page。

/*
Problem: 1028		User: DragonKnight
Memory: 712K		Time: 79MS
Language: G++		Result: Accepted
*/
#include <iostream>
#include <string>
#include <stack>
using namespace std;

int main()
{
    string command, website;
    stack<string> back,forward;//前进栈，后退栈
    string curWebsite = "http://www.acm.org/";//初始载入的页面

    while(cin >> command)
    {
        if(command == "QUIT")
        {
            break;
        }
        else if(command == "VISIT")
        {
            cin >> website;
            back.push(curWebsite);
            curWebsite = website;
            cout << curWebsite << endl;
            while(!forward.empty()) forward.pop();
        }
        else if(command == "BACK")
        {

            if(!back.empty())
            {
                forward.push(curWebsite);
                curWebsite = back.top();
                back.pop();
                cout << curWebsite << endl;
            }
            else
            {
                cout << "Ignored" << endl;
            }
        }
        else if(command == "FORWARD")
        {
            if(!forward.empty())
            {
                back.push(curWebsite);
                curWebsite = forward.top();
                forward.pop();
                cout << curWebsite << endl;
            }
            else
            {
                cout << "Ignored" << endl;
            }
        }
    }
    return 0;
}

转载于:https://my.oschina.net/lee24/blog/74471