|
|
|
|
|
#include<bits/stdc++.h>
|
|
|
|
|
|
|
|
|
|
|
|
using namespace std;
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
|
֪ʶ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ݣ<EFBFBD>STL ˫<EFBFBD>˶<EFBFBD><EFBFBD><EFBFBD>deque<EFBFBD><EFBFBD><EFBFBD><EFBFBD>
|
|
|
|
|
|
|
|
|
|
|
|
Deque<EFBFBD><EFBFBD>˫<EFBFBD>˶<EFBFBD><EFBFBD>У<EFBFBD><EFBFBD><EFBFBD>һ<EFBFBD>־<EFBFBD><EFBFBD>ж<EFBFBD><EFBFBD>к<EFBFBD>ջ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ʵ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>ݽṹ<EFBFBD><EFBFBD>˫<EFBFBD>˶<EFBFBD><EFBFBD>е<EFBFBD>Ԫ<EFBFBD>ؿ<EFBFBD><EFBFBD>Դ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>˵<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ɾ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ڱ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>˽<EFBFBD><EFBFBD>С<EFBFBD>
|
|
|
|
|
|
<EFBFBD>ĵ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>ݲο<EFBFBD><EFBFBD><EFBFBD>
|
|
|
|
|
|
https://www.cnblogs.com/aiguona/p/7281739.html
|
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
|
|
using namespace std;
|
|
|
|
|
|
|
|
|
|
|
|
int main() {
|
|
|
|
|
|
deque<int> ideq(20); //Create a deque ideq with 20 elements of default value 0
|
|
|
|
|
|
deque<int>::iterator pos;
|
|
|
|
|
|
int i;
|
|
|
|
|
|
|
|
|
|
|
|
//<2F><>ֵ
|
|
|
|
|
|
for (i = 0; i < 20; ++i)
|
|
|
|
|
|
ideq[i] = i;
|
|
|
|
|
|
|
|
|
|
|
|
//<2F><><EFBFBD><EFBFBD>deque
|
|
|
|
|
|
printf("<EFBFBD><EFBFBD><EFBFBD><EFBFBD>deque<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>:\n");
|
|
|
|
|
|
for (i = 0; i < 20; ++i)
|
|
|
|
|
|
printf("%d ", ideq[i]);
|
|
|
|
|
|
putchar('\n');
|
|
|
|
|
|
|
|
|
|
|
|
//<2F><>ͷβ<CDB7><CEB2><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
|
|
|
|
|
|
printf("\n<EFBFBD><EFBFBD>ͷβ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>...\n");
|
|
|
|
|
|
ideq.push_back(100);
|
|
|
|
|
|
ideq.push_front(i);
|
|
|
|
|
|
|
|
|
|
|
|
//<2F><><EFBFBD><EFBFBD>deque
|
|
|
|
|
|
printf("\n<EFBFBD><EFBFBD><EFBFBD><EFBFBD>deque<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>:\n");
|
|
|
|
|
|
for (pos = ideq.begin(); pos != ideq.end(); pos++)
|
|
|
|
|
|
printf("%d ", *pos);
|
|
|
|
|
|
putchar('\n');
|
|
|
|
|
|
|
|
|
|
|
|
//<2F><><EFBFBD><EFBFBD>
|
|
|
|
|
|
const int FINDNUMBER = 19;
|
|
|
|
|
|
printf("\n<EFBFBD><EFBFBD><EFBFBD><EFBFBD>%d\n", FINDNUMBER);
|
|
|
|
|
|
pos = find(ideq.begin(), ideq.end(), FINDNUMBER);
|
|
|
|
|
|
if (pos != ideq.end()) {
|
|
|
|
|
|
printf("find %d success\n", *pos);
|
|
|
|
|
|
} else
|
|
|
|
|
|
printf("find failed\n");
|
|
|
|
|
|
|
|
|
|
|
|
//<2F><>ͷβɾ<CEB2><C9BE><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
|
|
|
|
|
|
printf("\n<EFBFBD><EFBFBD>ͷβɾ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>...\n");
|
|
|
|
|
|
ideq.pop_back();
|
|
|
|
|
|
ideq.pop_front();
|
|
|
|
|
|
|
|
|
|
|
|
//<2F><><EFBFBD><EFBFBD>deque
|
|
|
|
|
|
printf("\n<EFBFBD><EFBFBD><EFBFBD><EFBFBD>deque<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>:\n");
|
|
|
|
|
|
for (pos = ideq.begin(); pos != ideq.end(); pos++)
|
|
|
|
|
|
printf("%d ", *pos);
|
|
|
|
|
|
putchar('\n');
|
|
|
|
|
|
return 0;
|
|
|
|
|
|
}
|
