9.18
#include <iostream>
#include <deque>
using namespace std;
int main()
{
deque<string> sd;
string s;
while (cin >> s)
sd.push_back(s);
for (auto beg = sd.begin(); beg != sd.end(); beg++)
cout << *beg << endl;
return 0;
}
9.19 用list代替deque即可,其他代码相同
9.20
#include <iostream>
#include <list>
#include <deque>
using namespace std;
int main()
{
list<int> ilist = {1, 2, 3, 4, 5, 6, 7, 8};
deque<int> odd, even;
for (auto iter = ilist.begin(); iter != ilist.end(); iter++) {
if (*iter%2 == 0)
odd.push_back(*iter);
else
even.push_back(*iter);
}
for (auto i : odd)
cout << i << endl;
for (auto j : even)
cout << j << endl;
return 0;
}
9.21 循环每次将元素插入vector的首前位置,iter始终指