算法库(二)

 

1.      remove:删除区间指定的值的元素.(这里并不缩小区间大小)

2.      distance:计算区间元素的个数(对非顺序容器)

list<int> int_lst;

         for ( int i = 0;i <= 7;i ++ )

         {

                   int_lst.push_back( i );

                   int_lst.push_front( i );

         }

         //print list

         cout<<"printlist\n";

         copy(int_lst.begin(),int_lst.end(),ostream_iterator<int>(cout,"\n" ) );

        

         list<int>::iteratoriterRemove = remove( int_lst.begin(),int_lst.end(),2 );

         cout<<"removelist print\n";

         copy(int_lst.begin(),int_lst.end(),ostream_iterator<int>(cout,"\n" ) );

 

         cout<<"begin-removeiterator\n";

         copy(int_lst.begin(),iterRemove,ostream_iterator<int>(cout,"\n" ) );

 

         cout<<"removeelement counts:"<<distance( iterRemove,int_lst.end() );

 

输出结果:

print list

7

6

5

4

3

2

1

0

0

1

2

3

4

5

6

7

remove list print

7

6

5

4

3

1

0

0

1

3

4

5

6

7

6

7

begin-remove iterator

7

6

5

4

3

1

0

0

1

3

4

5

6

7

remove element counts:2请按任意键继续. . .