顺序容器练习答案

版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/isunbin/article/details/89142915

练习9.26

#include <iostream>
#include <vector>
#include <list>

using namespace std;

int main()
{
    int ia[] = { 0, 1, 1, 2, 3, 5, 8, 13, 21, 55, 89 };

    vector<int> vec(ia, end(ia));
    list<int> lst(vec.begin(), vec.end());

    for(auto it = lst.begin();  it != lst.end(); ) //删除偶数
        if(*it & 0x1) it = lst.erase(it);
        else ++it;

    for(auto it = vec.begin();  it != vec.end(); )  //删除奇数
        if(! (*it & 0x1)) it = vec.erase(it);
        else ++it;

    cout << "list : ";
    for(auto i : lst)   cout << i << " ";
    cout << "\nvector : ";
    for(auto i : vec)   cout << i << " ";
    cout << endl;
    return 0;
}

输出结果:

猜你喜欢

转载自blog.csdn.net/isunbin/article/details/89142915