deque学习笔记

构造函数

//双端数组
#include<iostream>
#include<deque>
using namespace std;
//deque内部有一个中控器
void printDeque(deque<int>& d) {for (deque<int> ::iterator it = d.begin(); it != d.end(); it++) {cout << *it << " ";}
}
void test01() {deque<int> d1;for (int i = 0; i < 10; i++) {d1.push_back(i);}deque<int> d2(d1.begin(), d1.end());deque<int> d3(10, 100);deque<int> d4(d3);printDeque(d1);
}
int main() {test01();return 0;
}

deque中的插入和删除

#include<iostream>
#include<deque>
using namespace std;
//两端操作
void printDeque(const deque<int>& d) {for (deque<int> ::const_iterator it = d.begin(); it != d.end(); it++) {cout << *it << " ";}
}
void test01() {deque<int> d1;//尾插：d1.push_back(10);d1.push_back(20);//头插：d1.push_front(30);d1.push_front(40);//头删:d1.pop_front();//尾删：d1.pop_back();printDeque(d1);
}
void test02() {deque<int>d1;d1.push_back(10);d1.push_back(20);d1.push_front(30);d1.push_front(40);//insertd1.insert(d1.begin(), 10000);d1.insert(d1.begin(), 10250);//按照区间插入：deque<int> d3;d3.push_back(1);d3.push_back(2);d3.push_back(3);d1.insert(d1.begin(), d3.begin(), d3.end());d1.erase(d1.begin());
}
int main() {test01();return 0;
}

deque排序

#include<iostream>
#include<deque>
#include<algorithm>
using namespace std;
void test() {deque<int> d1;d1.push_back(10);d1.push_back(20);d1.push_back(50);d1.push_back(40);d1.push_back(44);d1.push_back(60);d1.push_back(90);//排序 默认是从小到大sort(d1.begin(), d1.end());
}   //vector容器也可以用STL都可以用
int main() {test();return 0;
}

deque复制操作

#include<iostream>
#include<deque>
using namespace std;
void printDeque(const deque<int>& d) {for (deque<int> ::const_iterator it = d.begin(); it != d.end(); it++) {cout << *it << " ";}
}
void test01() {deque<int> d1;for (int i = 0; i < 5; i++) {d1.push_back(i);}// = 赋值deque<int> d2 = d1;//assign赋值deque<int> d3;d3.assign(d1.begin(), d1.end());deque<int> d4(10, 100);
}
int main() {test01();return 0;
}