关于C++ Algorithm的例子

#include <iostream>
#include <map>
#include <deque>
#include <algorithm>
//迭代器的累加
void Iterator()
{
    std::map<int, int> ms{ {1, 100}, {2,200},{3,300},{4,400} };
    std::map<int, int>::iterator ite1;
    std::map<int, int>::iterator ite2;
    for (ite1 = ms.begin(); ite1 != ms.end(); ++ite1)
    {
        std::cout << ite1->second << "start\n";
        for (ite2 = std::next(ite1); ite2 != ms.end(); ++ite2)
        {
            std::cout << ite2->second << "\n";
        }
    }
}
//排序并删除重复项
void Unique()
{
    std::deque<double> t{ 2,3,6,8,2,4,5,3,6,8,7,6 };
    std::sort(t.begin(), t.end());
    //删除重复的点
    //std::unique(t.begin(), t.end());
    t.erase(unique(t.begin(), t.end()), t.end());
    std::cout << "ddd";
}
//删除特定原始
void Erase()
{
    std::deque<double> t{ 2,3,6,8,2,4,5,3,6,8,7,6 };

    t.erase(remove_if(t.begin(), t.end(), // range
        bind2nd(less<int>(),6)),  // remove criterion
        t.end());
    for (size_t i = 0; i < t.size(); i++)
    {
        std::cout<<t[i] << "\n";
    }
}

template <class T>
inline void PRINT_ELEMENTS(const T& coll, const char* optcstr = "")
{
    typename T::const_iterator pos;

    std::cout << optcstr;
    for (pos = coll.begin(); pos != coll.end(); ++pos) {
        std::cout << *pos << ' ';
    }
    std::cout << std::endl;
}


void erase1()
{
    set<int, greater<int>>  coll1;
    deque<int>  coll2;

    // insert elements from 1 to 9
    for (int i = 1; i <= 9; ++i) {
        coll1.insert(i);
    }

    PRINT_ELEMENTS(coll1, "initialized: ");

    // transform all elements into coll2 by multiplying 10
    transform(coll1.begin(), coll1.end(),        // source
        back_inserter(coll2),             // destination
        bind2nd(multiplies<int>(), 10));   // operation

    PRINT_ELEMENTS(coll2, "transformed: ");

    // Remove all elements with values less than 50
    coll2.erase(remove_if(coll2.begin(), coll2.end(), // range
        bind2nd(less<int>(), 50)),  // remove criterion
        coll2.end());

    PRINT_ELEMENTS(coll2, "removed:     ");
}
int main()
{
    std::cout << "Hello World!\n";
    Unique();
    
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值