poj 1028 Web Navigation(模拟题)
题目链接:http://poj.org/problem?id=1028
Description
The following commands need to be supported:
BACK: Push the current page on the top of the forward stack. Pop the page from the top of the backward stack, making it the new current page. If the backward stack is empty, the command is ignored.
FORWARD: Push the current page on the top of the backward stack. Pop the page from the top of the forward stack, making it the new current page. If the forward stack is empty, the command is ignored.
VISIT : Push the current page on the top of the backward stack, and make the URL specified the new current page. The forward stack is emptied.
QUIT: Quit the browser.
Assume that the browser initially loads the web page at the URL http://www.acm.org/
Input
Output
Sample Input
VISIT http://acm.ashland.edu/ VISIT http://acm.baylor.edu/acmicpc/ BACK BACK BACK FORWARD VISIT http://www.ibm.com/ BACK BACK FORWARD FORWARD FORWARD QUIT
Sample Output
http://acm.ashland.edu/ http://acm.baylor.edu/acmicpc/ http://acm.ashland.edu/ http://www.acm.org/ Ignored http://acm.ashland.edu/ http://www.ibm.com/ http://acm.ashland.edu/ http://www.acm.org/ http://acm.ashland.edu/ http://www.ibm.com/ Ignored
Source
题意:
模拟浏览器浏览网页是前后翻页!
思路:
开两个栈,分别存储当前网页前后的网页,注意新访问一个网页时,应该把当前网页的前面的栈清空!
代码如下:
#include <iostream> #include <algorithm> #include <string> #include <stack> using namespace std; stack <string>b; stack <string>f; int main() { string tt = "http://www.acm.org/"; string s; while(cin >> s) { if(s == "QUIT") break; if(s == "VISIT") { b.push(tt); cin >> tt; cout<<tt<<endl;//始终输出当前页 while(!f.empty())//当新访问一个页面的时候把之前页面前面的清空 { f.pop(); } } else if(s == "BACK") { if(!b.empty()) { f.push(tt); tt = b.top(); b.pop(); cout<<tt<<endl;//始终输出当前页 } else cout<<"Ignored"<<endl; } else { if(!f.empty()) { b.push(tt); tt = f.top(); f.pop(); cout<<tt<<endl;//始终输出当前页 } else cout<<"Ignored"<<endl; } } return 0; }
郑重声明:本站内容如果来自互联网及其他传播媒体,其版权均属原媒体及文章作者所有。转载目的在于传递更多信息及用于网络分享,并不代表本站赞同其观点和对其真实性负责,也不构成任何其他建议。