C++之STL--什么是双端队列Deque
双端队列表示双端队列。它属于数据结构队列中的一种,即可以从前端或后端的两端进行插入和删除。
Deque创建方式deque<object type> variable
同样需要声明头文件#include<deque>
#include <iostream>
#include <deque>
using namespace std;
int main() {
deque<string> deque_string;
deque_string.emplace_back("hello world!");
deque_string.emplace_back("i am a algorithm engineer");
deque<string>::iterator iterator1 = deque_string.begin();
cout << "------------deque_string--------------" << endl;
while (iterator1 != deque_string.end()) {
cout << *iterator1 << endl;
++iterator1;
}
deque<string> copy_string;
copy_string.operator=(deque_string);
cout << "------------copy_string---------------" << endl;
for (deque<string>::iterator iterator1 = copy_string.begin(); iterator1 != copy_string.end();
++iterator1) {
cout << *iterator1;
}
cout << endl;
cout << "deque_maxsize:" << copy_string.max_size() << endl;
cout << "maxsize_two:" << deque_string.max_size() << endl;
cout << deque_string.empty() << endl;
return 0;
}
输出:
------------deque_string--------------
hello world!
i am a algorithm engineer
------------copy_string---------------
hello world!i am a algorithm engineer
deque_maxsize:576460752303423487
maxsize_two:576460752303423487
0 //deque对象不为null
deque常用函数与vector相似