ZOJ1061 Web Navigation
原始版本:
#include <iostream>
#include <stack>
#include <string>
using namespace std;
class WebNavigation
{
private:
string curURL;//当前访问页面
string command;//当前待处理的命令
stack<string> forwardStack,backwardStack;//前进栈,后退栈
bool isFinished;//是否处理完毕
void ClearStack(stack<string>& s);//清空栈
void Back();//退后
void Forward();//向前
void Visit();//访问新URL
public:
WebNavigation();
~WebNavigation();
bool IsFinished()const
{//是否处理完毕
return this->isFinished;
}
void Process();//实际处理
friend istream& operator>> (istream& in,WebNavigation& webNavi);
};
WebNavigation::WebNavigation()
{
this->curURL = "http://www.acm.org/";//默认首页
this->isFinished = false;
}
WebNavigation::~WebNavigation()
{//确保退出时清空使用的栈
ClearStack(this->forwardStack);
ClearStack(this->backwardStack);
}
void WebNavigation::Back()
{//退后
if (!backwardStack.empty())
{//退后栈中有历史记录
forwardStack.push(curURL);//当前页面进入前进栈
//从退出栈中栈顶取出页面为当前页面
curURL = backwardStack.top();
cout<<curURL<<endl;
backwardStack.pop();
}
else
{
cout<<"Ignored"<<endl;
}
}
void WebNavigation::ClearStack(stack<string>& s)
{//清空栈
while (!s.empty())
{
s.pop();
}
}
void WebNavigation::Forward()
{//向前
if (!forwardStack.empty())
{//前进栈中有历史记录
backwardStack.push(curURL);//当前页面进入后退栈
//从前进栈中栈顶取出页面为当前页面
curURL = forwardStack.top();
cout<<curURL<<endl;
forwardStack.pop();
}
else
{
cout<<"Ignored"<<endl;
}
}
void WebNavigation::Visit()
{//访问新URL
backwardStack.push(curURL);//当前页面进入后退栈
cin>>curURL;
cout<<curURL<<endl;
ClearStack(forwardStack);//清空前进栈
}
void WebNavigation::Process()
{
if (command[0]=='Q')
{//退出
this->isFinished = true;
}
else if(command[0]=='B')
{//退后
this->Back();
}
else if(command[0]=='V')
{//访问新URL
this->Visit();
}
else if(command[0]=='F')
{//前进
this->Forward();
}
}
istream& operator>> (istream& in,WebNavigation& webNavi)
{//输入当前命令
in>>webNavi.command;
return in;
}
int main(void)
{
int n,cases,i;
cin>>n;
for (cases=1;cases<=n;++cases)
{
WebNavigation webNavior;
if (cases!=1)
{
cout<<endl;
}
while(cin>>webNavior)
{//读入一行命令
webNavior.Process();
if (webNavior.IsFinished())
{//已经处理完毕
break;
}
}
}
return 0;
}
#include <iostream>
#include <stack>
#include <string>
using namespace std;
void ClearStack(stack<string>& s)
{//清空栈
while (!s.empty())
{
s.pop();
}
}
int main(void)
{
string command,newURL;
int n,cases,i;
cin>>n;
for (cases=1;cases<=n;++cases)
{
stack<string> forwardStack,backwardStack;//前进栈,后退栈
string curURL = "http://www.acm.org/";//当前访问页面
if (cases!=1)
{
cout<<endl;
}
while(cin>>command)
{//读入一行命令
if (command[0]=='Q')
{//退出
break;
}
else if(command[0]=='B')
{//退后
if (!backwardStack.empty())
{//退后栈中有历史记录
forwardStack.push(curURL);//当前页面进入前进栈
//从退出栈中栈顶取出页面为当前页面
curURL = backwardStack.top();
cout<<curURL<<endl;
backwardStack.pop();
}
else
{
cout<<"Ignored"<<endl;
}
}
else if(command[0]=='V')
{//访问新URL
backwardStack.push(curURL);//当前页面进入后退栈
cin>>curURL;
cout<<curURL<<endl;
ClearStack(forwardStack);//情况前进栈
}
else if(command[0]=='F')
{//前进
if (!forwardStack.empty())
{//前进栈中有历史记录
backwardStack.push(curURL);//当前页面进入后退栈
//从前进栈中栈顶取出页面为当前页面
curURL = forwardStack.top();
cout<<curURL<<endl;
forwardStack.pop();
}
else
{
cout<<"Ignored"<<endl;
}
}
}
}
return 0;
}
#include <stack>
#include <string>
using namespace std;
void ClearStack(stack<string>& s)
{//清空栈
while (!s.empty())
{
s.pop();
}
}
int main(void)
{
string command,newURL;
int n,cases,i;
cin>>n;
for (cases=1;cases<=n;++cases)
{
stack<string> forwardStack,backwardStack;//前进栈,后退栈
string curURL = "http://www.acm.org/";//当前访问页面
if (cases!=1)
{
cout<<endl;
}
while(cin>>command)
{//读入一行命令
if (command[0]=='Q')
{//退出
break;
}
else if(command[0]=='B')
{//退后
if (!backwardStack.empty())
{//退后栈中有历史记录
forwardStack.push(curURL);//当前页面进入前进栈
//从退出栈中栈顶取出页面为当前页面
curURL = backwardStack.top();
cout<<curURL<<endl;
backwardStack.pop();
}
else
{
cout<<"Ignored"<<endl;
}
}
else if(command[0]=='V')
{//访问新URL
backwardStack.push(curURL);//当前页面进入后退栈
cin>>curURL;
cout<<curURL<<endl;
ClearStack(forwardStack);//情况前进栈
}
else if(command[0]=='F')
{//前进
if (!forwardStack.empty())
{//前进栈中有历史记录
backwardStack.push(curURL);//当前页面进入后退栈
//从前进栈中栈顶取出页面为当前页面
curURL = forwardStack.top();
cout<<curURL<<endl;
forwardStack.pop();
}
else
{
cout<<"Ignored"<<endl;
}
}
}
}
return 0;
}
重构后的版本:
#include <iostream>
#include <stack>
#include <string>
using namespace std;
class WebNavigation
{
private:
string curURL;//当前访问页面
string command;//当前待处理的命令
stack<string> forwardStack,backwardStack;//前进栈,后退栈
bool isFinished;//是否处理完毕
void ClearStack(stack<string>& s);//清空栈
void Back();//退后
void Forward();//向前
void Visit();//访问新URL
public:
WebNavigation();
~WebNavigation();
bool IsFinished()const
{//是否处理完毕
return this->isFinished;
}
void Process();//实际处理
friend istream& operator>> (istream& in,WebNavigation& webNavi);
};
WebNavigation::WebNavigation()
{
this->curURL = "http://www.acm.org/";//默认首页
this->isFinished = false;
}
WebNavigation::~WebNavigation()
{//确保退出时清空使用的栈
ClearStack(this->forwardStack);
ClearStack(this->backwardStack);
}
void WebNavigation::Back()
{//退后
if (!backwardStack.empty())
{//退后栈中有历史记录
forwardStack.push(curURL);//当前页面进入前进栈
//从退出栈中栈顶取出页面为当前页面
curURL = backwardStack.top();
cout<<curURL<<endl;
backwardStack.pop();
}
else
{
cout<<"Ignored"<<endl;
}
}
void WebNavigation::ClearStack(stack<string>& s)
{//清空栈
while (!s.empty())
{
s.pop();
}
}
void WebNavigation::Forward()
{//向前
if (!forwardStack.empty())
{//前进栈中有历史记录
backwardStack.push(curURL);//当前页面进入后退栈
//从前进栈中栈顶取出页面为当前页面
curURL = forwardStack.top();
cout<<curURL<<endl;
forwardStack.pop();
}
else
{
cout<<"Ignored"<<endl;
}
}
void WebNavigation::Visit()
{//访问新URL
backwardStack.push(curURL);//当前页面进入后退栈
cin>>curURL;
cout<<curURL<<endl;
ClearStack(forwardStack);//清空前进栈
}
void WebNavigation::Process()
{
if (command[0]=='Q')
{//退出
this->isFinished = true;
}
else if(command[0]=='B')
{//退后
this->Back();
}
else if(command[0]=='V')
{//访问新URL
this->Visit();
}
else if(command[0]=='F')
{//前进
this->Forward();
}
}
istream& operator>> (istream& in,WebNavigation& webNavi)
{//输入当前命令
in>>webNavi.command;
return in;
}
int main(void)
{
int n,cases,i;
cin>>n;
for (cases=1;cases<=n;++cases)
{
WebNavigation webNavior;
if (cases!=1)
{
cout<<endl;
}
while(cin>>webNavior)
{//读入一行命令
webNavior.Process();
if (webNavior.IsFinished())
{//已经处理完毕
break;
}
}
}
return 0;
}
作者:洞庭散人
出处:http://phinecos.cnblogs.com/
本博客遵从Creative Commons Attribution 3.0 License,若用于非商业目的,您可以自由转载,但请保留原作者信息和文章链接URL。
分类:
ACM
, C/C++/VC++
posted on 2008-10-28 11:38 Phinecos(洞庭散人) 阅读(1264) 评论(0) 编辑 收藏 举报
【推荐】国内首个AI IDE,深度理解中文开发场景,立即下载体验Trae
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步
· 如何编写易于单元测试的代码
· 10年+ .NET Coder 心语,封装的思维:从隐藏、稳定开始理解其本质意义
· .NET Core 中如何实现缓存的预热?
· 从 HTTP 原因短语缺失研究 HTTP/2 和 HTTP/3 的设计差异
· AI与.NET技术实操系列:向量存储与相似性搜索在 .NET 中的实现
· 周边上新:园子的第一款马克杯温暖上架
· Open-Sora 2.0 重磅开源!
· .NET周刊【3月第1期 2025-03-02】
· 分享 3 个 .NET 开源的文件压缩处理库,助力快速实现文件压缩解压功能!
· [AI/GPT/综述] AI Agent的设计模式综述
2006-10-28 WebCast听课录(10)
2006-10-28 WebCast听课录(9)