双向队列的操作如下:
<code class="hljs cpp has-numbering" style="display: block; padding: 0px; color: inherit; box-sizing: border-box; font-family: 'Source Code Pro', monospace;font-size:undefined; white-space: pre; border-radius: 0px; word-wrap: normal; background: transparent;"> <span class="hljs-stl_container" style="box-sizing: border-box;"><span class="hljs-built_in" style="color: rgb(102, 0, 102); box-sizing: border-box;">deque</span><ll></span>q;<span class="hljs-comment" style="color: rgb(136, 0, 0); box-sizing: border-box;">//定义一个双向队列q,类型为long long </span>
q.push_front(a);<span class="hljs-comment" style="color: rgb(136, 0, 0); box-sizing: border-box;">//将a从队首插入队列 </span>
q.push_back(a);<span class="hljs-comment" style="color: rgb(136, 0, 0); box-sizing: border-box;">//将a从队尾插入队列 </span>
q.pop_front();<span class="hljs-comment" style="color: rgb(136, 0, 0); box-sizing: border-box;">//队首弹掉一个元素 </span>
q.pop_back();<span class="hljs-comment" style="color: rgb(136, 0, 0); box-sizing: border-box;">//队尾弹出一个元素 </span>
a=q.front();<span class="hljs-comment" style="color: rgb(136, 0, 0); box-sizing: border-box;">//返回队首元素 </span>
a=q.back();<span class="hljs-comment" style="color: rgb(136, 0, 0); box-sizing: border-box;">//返回队尾元素 </span>
a=q.size();<span class="hljs-comment" style="color: rgb(136, 0, 0); box-sizing: border-box;">//返回双向队列的大小 </span>
a=q.empty();<span class="hljs-comment" style="color: rgb(136, 0, 0); box-sizing: border-box;">//判断双向队列是否为空,为空返回1,不为空返回0 </span>
<span class="hljs-stl_container" style="box-sizing: border-box;"><span class="hljs-built_in" style="color: rgb(102, 0, 102); box-sizing: border-box;">deque</span><ll></span>p(q);<span class="hljs-comment" style="color: rgb(136, 0, 0); box-sizing: border-box;">//将队列q复制一个新的队列p </span>
q.clear(); <span class="hljs-comment" style="color: rgb(136, 0, 0); box-sizing: border-box;">//将队列q清空 </span></code>
本文详细介绍了STL中的双端队列deque,包括其基本操作、插入和删除元素的方法,以及在实际编程中的应用示例,帮助读者掌握这一数据结构的使用。
918

被折叠的 条评论
为什么被折叠?



