C++ Primer 学习笔记 第十一章 关联容器

最新推荐文章于 2022-08-22 20:46:31 发布
最新推荐文章于 2022-08-22 20:46:31 发布
阅读量496 收藏 1
点赞数
文章标签： C c++
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/HELLOWORLD2424/article/details/122623829
版权

375 map函数的使用

#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <list>
#include <map>
using namespace std;


int main() {
    map<string, size_t> word_count;
    vector<string> vec = {"a", "a", "b", "c", "c", "d"};

    for (auto s:vec){
        ++word_count[s];
    }
    for (const auto &w:word_count){
        cout << w.first << " occours " << w.second << ((w.second>1)? " times": " time") << endl;

    }

    return 0;
    /*
        a occours 2 times
        b occours 1 time
        c occours 2 times
        d occours 1 time
     * */
}

375 加上set去除相关的值

#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <list>
#include <map>
#include <set>
using namespace std;


int main() {
    map<string, size_t> word_count;
    vector<string> vec = {"apple", "a", "apple", "strawberry", "a", "an"};
    set<string> exclude = {"a", "an"};

    for (auto s:vec){
        if (exclude.find(s)==exclude.end()) {
            // not found in exclude list
            ++word_count[s];
        }
    }
    for (const auto &w:word_count){
        cout << w.first << " occours " << w.second << ((w.second>1)? " times": " time") << endl;

    }

    return 0;
    /*
    apple occours 2 times
    strawberry occours 1 time
     * */
}

377 set multiset

#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <list>
#include <map>
#include <set>
using namespace std;


int main() {
    vector<int> ivec;
    for (vector<int>::size_type i=0; i!=10; ++i){
        ivec.push_back(i);
        ivec.push_back(i);
    }
    set<int> iset(ivec.begin(), ivec.end());
    multiset<int> miset(ivec.begin(), ivec.end());
    cout << ivec.size() << endl; //20
    cout << iset.size() << endl; //10
    cout << miset.size() << endl; //20

    return 0;

}

11.7

#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <list>
#include <map>
#include <set>
#include <iterator>
using namespace std;


int main() {
    map<string, vector<string>> family;
    family["liang"] = vector<string>({"jxl", "zyl"});
    family["zhu"] = vector<string>({"jtz", "zyz"});
    ostream_iterator<string> iter(cout, " ");
    for (const auto &w:family){
        cout << "surname: " << w.first << " members: ";
        copy(w.second.begin(), w.second.end(), iter);
        cout << endl;
    }

    return 0;

}

11.12 pair的三种创建方式

#include <iostream>
#include <vector>
#include <iterator>
#include <algorithm>
#include <utility>
#include <string>
using namespace std;


int main() {

    vector<string> svec = {"apple", "banana", "pairs", "cherry"};
    vector<int> ivec = {1, 2, 3, 4};
    vector<pair<int, string>> wvec;

    for (int i=0; i!=svec.size(); ++i){
        // method 1
//        wvec.push_back({ivec[i], svec[i]});
        // method 2
//        wvec.emplace_back(ivec[i], svec[i]);
        // method 3
        wvec.push_back(make_pair(ivec[i], svec[i]));
    }

    for (auto item:wvec){
        cout << "first: " << item.first << " second: " << item.second;
        cout << endl;
    }
    cout << endl;
    return 0;

}

11.14

#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <list>
#include <map>
#include <set>
#include <iterator>
using namespace std;


int main() {
    map<string, vector<pair<string, string>>> family1;
    family1["liang"].emplace_back("liang", "1222");
    family1["chen"].emplace_back("zhu", "1123");
    for(const auto i:family1){
        cout << i.first;
        for (const auto j:i.second){
            cout << j.first << j.second;
        }
        cout << endl;
    }
    return 0;
}

382 map关联容器的迭代器

#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <list>
#include <map>
#include <set>
using namespace std;


int main() {
    map<string, size_t> word_count;
    vector<string> vec = {"apple", "a", "apple", "strawberry", "a", "an"};
    set<string> exclude = {"a", "an"};

    for (auto s:vec){
        if (exclude.find(s)==exclude.end()) {
            // not found in exclude list
            ++word_count[s];
        }
    }
    for (const auto &w:word_count){
        cout << w.first << " occours " << w.second << ((w.second>1)? " times": " time") << endl;

    }
    /*
    apple occours 2 times
    strawberry occours 1 time
     * */
    auto map_it = word_count.begin();
    cout << map_it->first;
    cout << " " << map_it->second << endl;
    ++map_it->second;
    cout << " " << map_it->second << endl;
    cout << (++map_it)->first<< " " << "second: " << (++map_it)->second<<endl;
    return 0;

}

382 遍历关联容器

#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <list>
#include <map>
#include <set>
#include <iterator>
using namespace std;


int main() {
    map<string, size_t> word_count;
    set<string> exclude = {"a"};

    vector<string> ivec = {"apple", "banana", "apple", "a"};

    for (auto word:ivec){
        if (exclude.find(word)==exclude.end())
            ++word_count[word];
    }

    auto map_it = word_count.cbegin();
    while(map_it != word_count.cend()) {
        cout << map_it->first << " occours " << map_it->second << " times" << endl;
        ++map_it;
    }

    return 0;

}

11.16

#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <list>
#include <map>
#include <set>
#include <iterator>
using namespace std;


int main() {
    map<string, int> mp;
    mp["person"] = 2;
    auto map_iter = mp.begin();
    map_iter->second++;
    cout << map_iter->second << endl;
    return 0;

}

384 关联容器插入元素的方法

#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <list>
#include <map>
#include <set>
#include <iterator>
using namespace std;


int main() {
vector<int> ivec = {2, 4, 6, 8, 2, 4, 6, 8};
set<int> set2;
set2.insert(ivec.cbegin(), ivec.cend());

    ostream_iterator<int> oiter(cout, " ");
    copy(set2.begin(), set2.end(), oiter);
    cout << endl;
    // 2 4 6 8
    set2.insert({1, 3, 5, 7, 1, 3, 5, 7});
    copy(set2.begin(), set2.end(), oiter);
    // 1 2 3 4 5 6 7 8
    cout << endl;

    map<string, size_t> word_count;
    string word = "c++ primer";
    word_count.insert({word, 1});
    word_count.insert({word, 1});
    auto pi = word_count.begin();
    cout << pi->first << " " << pi->second << endl;
    word_count.insert(make_pair(word, 1));
    word_count.insert(pair<string, size_t>(word, 1));
    word_count.insert(map<string, size_t>::value_type(word, 1));

    return 0;

}

385 insert的返回值

#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <list>
#include <map>
#include <set>
#include <iterator>
using namespace std;


int main() {

    map<string, size_t> word_count;
    string word;
    while(cin >> word){
        auto ret = word_count.insert({word, 1});
        if (!ret.second){
            ++ret.first->second;
        }

        for (auto iter=word_count.begin(); iter!=word_count.end(); ++iter){
            cout << iter->first << ": " << iter->second << endl;
        }
    }
    return 0;

}

386

#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <list>
#include <map>
#include <set>
#include <iterator>
using namespace std;


int main() {

    map<string, size_t> word_count;
    string word;
    while(cin >> word){
        auto ret = word_count.insert({word, 1});
        if (!ret.second){
            ++ret.first->second;
        }
        for (auto iter=word_count.begin(); iter!=word_count.end(); ++iter){
            cout << iter->first << ": " << iter->second << endl;
        }
    }
    cout << endl;

    multimap<string, string> authors;
    authors.insert({"ben", "start wars"});
    authors.insert({"ben", "x wars"});
    for (auto iter=authors.begin(); iter!=authors.end(); ++iter){
        cout << iter->first << ": " << iter->second << endl;
    }
    return 0;

}

386 关联容器删除元素

#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <list>
#include <map>
#include <set>
#include <iterator>
using namespace std;


int main() {

    multimap<string, string> authors;
    authors.insert({"ben", "start wars"});
    authors.insert({"ben", "x wars"});
    for (auto iter=authors.begin(); iter!=authors.end(); ++iter){
        cout << iter->first << ": " << iter->second << endl;
    }
    /*
       ben: start wars
       ben: x wars
     * */

    string remove_word = "ben";
    size_t ret = authors.erase(remove_word);
    cout << "number of elements being erased: " << ret << endl; // 2
    if (ret)
        cout << "ok: " << remove_word << " removed\n";
    else
        cout << "oops: " << remove_word << "not found!\n";

    return 0;

}

389 访问元素

#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <list>
#include <map>
#include <set>
#include <iterator>
using namespace std;


int main() {
    set<int> iset = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9};
    iset.find(1);
    iset.find(11);
    iset.count(1);
    iset.count(11);

    map<string, int> word_count;
    if (word_count.find("foobar") == word_count.end())
        cout << "foobar is not in the map" << endl;

    return 0;

}

遍历multimap中的重复元素

#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <list>
#include <map>
#include <set>
#include <iterator>
using namespace std;


int main() {
    multimap<string, string> authors;
    authors.emplace("libai", "abc");
    authors.emplace("libai", "efg");

    string search_item("libai");
    auto entries = authors.count(search_item);
    cout << "number of libai " << entries << endl;

    auto iter = authors.find(search_item);
    while(entries){
        cout << iter->second << endl;
        ++ iter;
        --entries;

    }
    return 0;
}

391 定位区间,查找关联容器中的元素

#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <list>
#include <map>
#include <set>
#include <iterator>
using namespace std;


int main() {
    multimap<string, string> authors;
    authors.emplace("libai", "abc");
    authors.emplace("dufu", "efg");
    authors.emplace("libai", "hij");

    string search_item("libai");
    auto entries = authors.count(search_item);
    
    // lower_bound upper_bound配合定位到元素出现的区间
    for (auto beg=authors.lower_bound(search_item),
            end=authors.upper_bound(search_item); beg!=end; ++beg){
        cout << beg->second << endl;
    }
    // abc
    // hij


    // equal_range直接定位区间
    for (auto pos=authors.equal_range(search_item);pos.first!=pos.second;++pos.first){
        cout << pos.first->second << endl;
    }
    // abc
    // hij


    return 0;
}

11.28

#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <list>
#include <map>
#include <set>
#include <iterator>
using namespace std;


int main() {

    map<string, int> word_count;
    word_count.insert({"apple", 1});
    word_count.insert({"orange", 1});

    string search_strr = "apple";
    map<string,int>::iterator ret = word_count.find(search_strr);
    cout << ret->first << endl;

    return 0;
}

11.31 map的两种遍历的方式

#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <list>
#include <map>
#include <set>
#include <iterator>
using namespace std;


int main() {
multimap<string, string> authors;
authors.emplace("libai", "abc");
authors.emplace("dufu", "efg");
authors.emplace("libai", "hij");
authors.emplace("baijuyi", "lmn");

string search_item("libai");

map<string,string>::iterator ret = authors.find("libai");

if (!(ret==authors.cend())){
authors.erase(search_item);
}

for (map<string, string>::const_iterator iter=authors.cbegin(); iter!=authors.cend(); ++iter){
cout << iter->first << " " << iter->second << endl;
}

for (pair<string, string> item:authors){
cout << item.first << " " << item.second << endl;

}


return 0;
}

11.32

#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <list>
#include <map>
#include <set>
#include <iterator>
using namespace std;


int main() {
    multimap<string, string> authors;
    authors.emplace("libai", "abc");
    authors.emplace("dufu", "efg");
    authors.emplace("libai", "hij");
    authors.emplace("baijuyi", "lmn");



    for (map<string, string>::const_iterator iter=authors.cbegin(); iter!=authors.cend(); ++iter){
        cout << iter->first << " " << iter->second << endl;
    }

    cout << endl;

    for (pair<string, string> item:authors){
        cout << item.first << " " << item.second << endl;

    }


    return 0;
}

392 关联容器综合练习,读入文本按照规则变换后输出

re.txt

k okay?
y why
r are
u you
pic picture
thk thanks!
18r later

input.txt

where r u
y dont u send me a pic
k thk 18r

#include <iostream>
#include <fstream>
#include <sstream>
#include <algorithm>
#include <vector>
#include <string>
#include <list>
#include <map>
#include <set>
#include <iterator>
using namespace std;

map<string, string> buildMap(ifstream &map_file){
    map<string, string> trans_map;
    string line;
    while(getline(map_file, line)){
        auto pos = line.find(" ");

        if (!(pos == line.npos)) {
            string key(line.begin(), line.begin() + pos);
            string value(line.begin() + pos + 1, line.end());

            trans_map[key] = value;
        } else{
            throw runtime_error("no rule for " + line);
        }
    }
    return trans_map;
}


const string & transform(const string &s, const map<string, string> &m){
    auto map_it = m.find(s);
    if (map_it!=m.cend()){
        return map_it->second;
    } else{
        return s;
    }
}


void word_transform(ifstream &map_file, ifstream &input, ofstream &output){
    auto trams_map = buildMap(map_file);
    string text;
    while (getline(input, text)){
        istringstream stream(text);
        string word;
        bool firstword = true;
        while (stream>>word){
            if (firstword) {
                firstword = false;
            }else{
                output << " ";
                cout << " ";
            }
            output << transform(word, trams_map);
            cout << transform(word, trams_map);
        }
        output << endl;
        cout << endl;
    }
}


int main() {
    ifstream re("re.txt");
    ifstream input("input.txt");
    ofstream output("output.txt");
    word_transform(re, input, output);
    return 0;
}

394 使用无序容器

#include <iostream>
#include <fstream>
#include <sstream>
#include <algorithm>
#include <vector>
#include <string>
#include <list>
#include <map>
#include <unordered_map>
#include <set>
#include <iterator>
using namespace std;

int main() {
    unordered_map<string, size_t> word_count;
    string word;
    while(cin>>word){
        ++word_count[word];
        for(const auto &w:word_count){
            cout << w.first << " occurs " << w.second << ((w.second>1)? " times":" time") << endl;
        }

    }


    return 0;
}
HELLOWORLD2424
关注
C++ primer 5th，第十一章——关联容器
01-27
C++ primer 5th，第十一章——关联容器，笔记&思维导图 按教材整理。
【C++】学习笔记[二十一]
csdn_edition的博客
01-11 461
文章目录STL常用算法【排序、拷贝和替换】1、sort2、random_shuffle3、merge4、reverse5、copy6、replace7、replace_if8、swap STL常用算法【排序、拷贝和替换】 1、sort 对容器内元素进行排序 练习代码： #include <iostream> #include <vector> #include <string> #include <algorithm> #include <funct
C++小练习
weixin_42542629的博客
06-28 91
#include <iostream> #include <string> #include <vector> #include <algorithm> using namespace std; class Box { private: double m_height; double m_breadth; double m_length; public: void setHeight(double height) { m_height = h
C++面试基础 2
北极星的博客
07-08 150
1.输入一个字符串，将其逆序后输出 #include <iostream> #include <cstring> #include <cstdio> using namespace std; int main(){ char data[10]={'\0'}; cin.getline(data,10,'\n'); char temp='\...
PAT乙级题：1003我要通过！
weixin_34112208的博客
03-18 47
1 #include <iostream> 2 #include <string> 3 #include <vector> 4 #include <algorithm> 5 using namespace std; 6 //题目贼恶心，竟然没有说出A存在的规律！！！！！ 7 //首先，必须要有PAT存在，且不能有其他字符...
#include <map>
qq_44794039的博客
05-11 389
#include <map> #include <map> #include <string> #include <iostream> using namespace std; int main() { map<int, string> mapStudent; mapStudent[1] = "studen...
C++Primer笔记之关联容器的使用详解
09-05
关联容器是C++标准库中一类特殊的容器，它们允许通过键（key）高效地查找、插入和删除元素。本文将深入解析C++ Primer中提到的关联容器，特别是map和set的使用。 首先，关联容器包括set、map、multiset和multimap四...
C++ Primer学习笔记详解
最新发布
09-14
内容概要：这是关于《C++ Primer学习笔记》的文章，涵盖多种类型转换、异常机制、类静态成员、IO库介绍、顺序容器操作、泛型算法应用、关联容器概念与使用详解、动态内存智能指针管理、构造函数与拷贝构造细节探讨、...
《C++ Primer》学习笔记（27）顺序容器
07-21
### 《C++ Primer》学习笔记（27）顺序容器 #### 9.1 顺序容器概述 在C++中，顺序容器是一类用于存储数据的容器，其中元素的位置依赖于其添加到容器中的顺序。这与关联容器形成了对比，关联容器中的元素位置是由其...
C++ Primer 学习笔记 第十七章 标准库特殊设施
HELLOWORLD2424的博客
03-11 452
标准库特殊设施 637 初始化tuple #include <iostream> #include <vector> #include <string> #include <list> #include <iterator> #include <memory> #include <fstream> #include <algorithm> #include <functional> #include
C++笔记（二十三）容器之vector
貌似君子的专栏
03-06 268
#include&lt;iostream&gt; #include&lt;vector&gt; #include&lt;string&gt; #include&lt;algorithm&gt; /* vector是数组的一种类表示方式，提供了自动内存管理，随机访问，可以动态的改变长度。 在尾部添加和删除元素的时间是固定的，在头部和中间添加和删除元素的时间的线性的。 与vector类似的还有deq...
C++基本知识学习(8.22)。
qq_41292565的博客
08-22 334
C++基本知识
牛客网&&华为机试&&字串的连接最长路径的查找
weixin_42060900的博客
07-29 287
牛客网&&华为机试&&字串的连接最长路径的查找 代码实现 #include<iostream> #include<string> #include<vector> #include<algorithm> using std::cin; using std::cout; using std::endl; using ...
C++学习-Day-33
school751953的博客
08-19 135
C++学习-Day-33一、编程练习 一、编程练习 16_1 #include<iostream> #include<string> #include<cctype> int main() { using std::string; using std::cin; using std::cout; using std::endl...
#include <vector>
今日
01-29 6389
1/31：sort(左迭代器，右迭代器，排序方法)； 其中排序方法bool myfunction (int i,int j) { return (i此处是降序 感觉和qsort差不多，如果是结构体的话就 bool cmp(NODE* a,NODE *b){return(a.number>b.number);} //另外今天又忘了v.end()是最后一个元素的
C++ Primer习题解答 Chapter10
cmiao-me
02-24 365
10-1 #include<iostream> #include<vector> #include<string> #include<cctype> #include<iterator> #include<stdexcept> #include<algorithm> #include<fstream> ...
第9章习题 定义新类型
韩江雪de 小屋
03-13 555
文章目录1 编译运行本章的程序2 重写Student_info类，使它在读学生记录时计算成绩，并将成绩存储在对象中。重新实现garde函数，让它使用这个预计算的值。3 将name函数定义成一个简单、非常量的成员函数，其他函数该如何改动？3 捕获当未读入Student_ingo对象的值而调用grade函数引发的异常4 使用vail函数避免异常发生5 编写一个类和相关函数为学生产生成绩，pass及格/...
C++:::List 用法简单介绍 (杂)
热门推荐
04-11 1万+
Lists将元素按顺序储存在链表中. 与 向量(vectors)相比, 它允许快速的插入和删除，但是随机访问却比较慢.assign() 给list赋值 back() 返回最后一个元素 begin() 返回指向第一个元素的迭代器 clear() 删除所有元素 empty() 如果list是空的则返回true end() 返回末尾的迭代器 erase() 删除一个元素 front() 返回第一个元
C++ Primer 学习笔记 第十五章面向对象程序设计
HELLOWORLD2424的博客
02-18 299
C++ Primer 学习笔记 第十五章面向对象程序设计 527 类的继承和函数绑定 #include <iostream> #include <vector> #include <string> #include <list> #include <iterator> #include <memory> #include <fstream> #include <algorithm> #include <fu
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

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

抵扣说明：

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

余额充值