1 #include<iostream>
2 #include<deque>
3 #include<algorithm>
4
5 int main()
6
7 {
8 using namespace std;
9
10 deque<int> a;
11
12 a.push_back(3);
13 a.push_back(4);
14 a.push_back(5);
15
16 a.push_front(2);
17 a.push_front(1);
18 a.push_front(0);
19
20 for(size_t nCount = 0; nCount <a.size(); ++nCount)
21 {
22
23 cout << "a[" << nCount << "] = ";
24 cout << a[nCount] << endl;
25
26
27 }
28
29
30 a.pop_front();
31 a.pop_back();
32
33 cout << endl;
34 cout << endl;
35
36 /*for(size_t nCount = 0; nCount <a.size(); ++nCount)
37 {
38
39 cout << "a[" << nCount << "] = ";
40 cout << a[nCount] << endl;
41
42
43 }
44 */
45
46 //无下标
47 //distance算法
48 deque<int>::iterator iElementLocater;
49 for(iElementLocater = a.begin();
50 iElementLocater !=a.end();
51 ++iElementLocater)
52 {
53 size_t nOffset = distance(a.begin(),iElementLocater);//begin指向deque的开头
54 cout <<"a[" << nOffset << "] =" << *iElementLocater<<endl;
55 }
56
57
58
59
60
61 cout << endl;
62
63
64 return 0;
65
66 }
View Code
