POJ 1028 字符串

最新推荐文章于 2022-01-09 11:14:11 发布

原创最新推荐文章于 2022-01-09 11:14:11 发布 · 699 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#command #web #url

数据结构专栏收录该内容

16 篇文章

订阅专栏

本文介绍了一个简单的网页浏览模拟器实现方案。通过使用字符串数组来模拟浏览器的前进与后退功能，并详细解释了如何处理不同类型的命令，如 VISIT、BACK、FORWARD 和 QUIT。特别注意的是，在执行 VISIT 命令时需要清空之后的所有状态。

题意:

浏览网页,这里有几种操作:

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.

思路:模拟.设置一个字符串数组,用一个指针指向当前指向的网页,根据操作移动,唯一注意的是:执行VISIT时,前面的网页清空.

代码:

#include <cstdio> #include <cstring> #include <iostream> using namespace std; int main(void) { char web[200][100]; strcpy(web[0],"http://www.acm.org/"); char oper[100]; int top = 1,move = 0; while(scanf("%s",oper) != EOF) { char w[100]; if(strcmp(oper,"QUIT") == 0) break; if(strcmp(oper,"VISIT") == 0) { scanf("%s",w); strcpy(web[move+1],"/0"); strcpy(web[move+1],w); move++; top = move+1; printf("%s/n",w); } else if(strcmp(oper,"BACK") == 0) { if(move <= 0) printf("Ignored/n"); else { printf("%s/n",web[move-1]); move--; } } else if(strcmp(oper,"FORWARD") == 0) { if(move+1 >= top) printf("Ignored/n"); else { printf("%s/n",web[move+1]); move++; } } } return 0; }