POJ 1028 字符串

题意:

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

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; }