C++Primer第五版 9.3.3节练习

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

/*
*练习9.25
*2015/8/1
*问题描述：练习9.25：对于第312页中删除一个范围内的元素的程序，如果elem1与elem2相等，会发生什么？如果elem2是尾后迭代器，或者elem1和elem2皆为尾后迭代器，又会发生什么？
*功能：没有删除 
*作者：Nick Feng 
*邮箱：nickgreen23@163.com 
* 
*/

#include <iostream>
#include <string>
#include <vector>

using namespace std;

int main()
{
    vector<string> vec = {"This","is","a","test!"};
    vector<string>::iterator elem1 = vec.begin();
    vector<string>::iterator elem2 = vec.begin();
    vector<string>::iterator elem3 = vec.end();
    vector<string>::iterator elem4 = vec.end();

    for(auto i = 0; i != vec.size(); ++i)
        cout << vec[i] << " ";
        cout << endl;

    vec.erase(elem1,elem2);
    for(auto i = 0; i != vec.size(); ++i)
        cout << vec[i] << " ";
        cout << endl;

    vec.erase(elem3,elem4);
    for(auto i = 0; i != vec.size(); ++i)
        cout << vec[i] << " ";
        cout << endl;       
    return 0;
}

/*
*练习9.26
*2015/8/1
*问题描述：练习9.26：使用下面代码定义的ia，将ia拷贝到一个vector和一个list中。使用单迭代器版本的erease从list中删除奇数元素，从vector中删除偶数元素。
*int ia[]= {0,1,1,2,3,5,8,13,21,55,89}
*功能：对erease的使用
*说明：如果你清楚容器内部的类型，尽量不要用auto和decltype，因为，有时候编译器不是很靠谱 
*作者：Nick Feng 
*邮箱：nickgreen23@163.com 
* 
*/

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

using namespace std;

int main()
{
    int ia[] = {0,1,1,2,3,5,8,9,13,21,55,89};
    list<int> lst;
    vector<int> vec;
    for(int i = 0; i != 12; ++i)
       {
        vec.push_back(ia[i]);
        lst.push_back(ia[i]);
        cout << ia[i] << " ";   
      }
        cout << endl;

    vector<int>::iterator it = vec.begin();
    while(it != vec.end())
    {
        if(*it%2==0)
           {
           it = vec.erase(it);//删除偶数元素 
           }
        else
           ++it;
    }
    for(auto i = 0; i != vec.size();++i)
    cout << vec[i] << " ";
    cout << endl;

    list<int>::iterator item = lst.begin();
    while(item != lst.end())
    {
        if(*item%2)
        {
            item = lst.erase(item);
        }
        else
          ++item;
    }

    list<int>::iterator item1 =lst.begin();
    while(item1 != lst.end())
    {
        cout <<*item1<< " ";
        ++item1;
    }
     cout << endl;
    return 0;
 }