![](https://img-blog.csdnimg.cn/20201014180756930.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
栈和队列
请多指教^_^
这个作者很懒,什么都没留下…
展开
-
二叉堆实现优先队列(大根堆、小根堆)
大根堆大根堆是根节点比其儿子结点值要大的二叉堆,故优先队列的队首数值是最大的。具体实现见代码:#include<iostream>#include<cstdio>using namespace std;const int maxn = 1000;class Priority_queue //大根堆,优先队列{public: int heap[maxn], tot; Priority_queue(); ~Priority_queue(); void原创 2020-10-20 16:50:16 · 360 阅读 · 0 评论 -
小型计算器(后缀表达式计算)
对于普通的四则混合运算,可以将表达式通过转换成逆波兰式来进行计算。具体是通过栈来进行实现的,代码如下:代码:#include<iostream>#include<cstdio>#include<stack>#include<sstream>#include<string>using namespace std;string in, post;stack<char>st;stack<int>p;voi原创 2020-10-17 16:36:52 · 399 阅读 · 0 评论 -
迷宫问题再研究
迷宫问题属于简单的搜索问题,用dfs或者bfs即可比较轻松的解决。这里附上两种写法,用栈实现的dfs和用队列实现的bfs。队列实现bfs代码:#include<iostream>#include<stack>#include<queue>#include<algorithm>#include<cstdio>using namespace std;#define INF 0x3f3f3ftypedef pair<int, i原创 2020-10-17 16:30:17 · 114 阅读 · 0 评论 -
POJ 1363 Rails (值得一记的栈好题)
RailsTime Limit: 1000MS Memory Limit: 10000KDescriptionThere is a famous railway station in PopPush City. Country there is incredibly hilly. The station was built in last century. Unfortunately, funds were extremely limited that time. It was possibl原创 2020-07-16 17:04:07 · 591 阅读 · 0 评论