zoukankan      html  css  js  c++  java
  • 数据结构与算法分析 3.4&3.5 — 链表的交与并算法

    代码:

    #include <list>
    
    template<typename ElementType>
    list<ElementType> Intersect(const list<ElementType> &list_1, const list<ElementType> &list_2)
    {
        list<ElementType> result;
        auto leftPos = list_1.begin( );
        auto rightPos = list_2.begin( );
    while (leftPos != list_1.end() && rightPos != list_2.end()) { if (*leftPos > *rightPos) rightPos++; else if (*leftPos < *rightPos) leftPos++; else { result.push_back(*leftPos);++leftPos, ++rightPos; } } return result; } template<typename ElementType> list<ElementType> Union(const list<ElementType> &list_1, const list<ElementType> &list_2 ) { list<ElementType> result; auto leftPos = list_1.cbegin( ); auto rightPos = list_2.cbegin( ); while (leftPos != list_1.end() && rightPos != list_2.end()) { if (*leftPos < *rightPos) result.push_back(*leftPos), ++leftPos; else if (*leftPos > *rightPos) result.push_back(*rightPos), ++rightPos; else { result.push_back(*leftPos); ++leftPos, ++rightPos; } } while (leftPos != list_1.end( )) result.push_back(*leftPos), leftPos++; while (rightPos != list_2.end( )) result.push_back(*rightPos), rightPos++; return result; }
  • 相关阅读:
    lnmp之php5.6.29安装
    lnmp之mysql5.5.17安装
    利用xshell从windows上传文件到虚拟机
    linux命令
    tp中ueditor编辑器的使用
    Thinkphp 3.2.2 验证码check_verify方法,只能验证一次
    选学霸
    低价购买
    友好城市
    榨取kkksc03
  • 原文地址:https://www.cnblogs.com/tallisHe/p/4214113.html
Copyright © 2011-2022 走看看