hackerrank>Dashboard>C++>STL>Deque-STL

lose__way

于 2017-06-10 09:37:14 发布

阅读量624

点赞数

分类专栏： hackerrank STL 文章标签： hackerrank c语言 ACM stl

本文链接：https://blog.csdn.net/lose__way/article/details/72974541

版权

本文介绍了 C++ STL 中的 Deque 容器，它是一种双端队列，允许在两端进行插入和删除操作。主要内容包括 Deque 的基本操作如大小查询、元素推入和弹出、以及空判断等。接着，文章通过一个实例展示了如何找到数组中每个连续子数组的最大整数。题目要求处理多个数组，对于每个给定长度的子数组，找出最大值并输出。示例给出了输入输出样例，解释了如何找到每个大小为 2 或 4 的子数组的最大整数值。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Double ended queue or Deque(part of C++ STL) are sequence containers with dynamic sizes that can be expanded or contracted on both ends (either its front or its back). The member functions of deque that are mainly used are:

Deque Template:
```
std::deque<value_type>
```

Declaration:

deque<int> mydeque; //Creates a double ended queue of deque of int type

Size

int length = mydeque.size(); //Gives the size of the deque

Push

mydeque.push_back(1); //Pushes element at the end
mydeque.push_front(2); //Pushes element at the beginning

Pop

mydeque.pop_back(); //Pops element from the end
mydeque.pop_front(); //Pops element from the beginning

Empty

mydeque.empty() //Returns a boolean value which tells whether the deque is empty or not

To know more about deque, click here

Given a set of arrays o

最低0.47元/天解锁文章