11.2.1

最新推荐文章于 2025-09-11 02:43:12 发布

原创最新推荐文章于 2025-09-11 02:43:12 发布 · 253 阅读

0 ·

CC 4.0 BY-SA版权

C++ Primer第五版练习专栏收录该内容

181 篇文章

订阅专栏

本文详细介绍了C++标准模板库(STL)中的几种关键容器类型：set、map、list及vector的特点与应用场景。对比了set与map、list与set在元素存储、查找效率、插入删除操作等方面的差异，并通过示例代码展示了如何使用map来组织家庭成员信息以及如何利用vector进行数据搜索。

11.5
set中保存一个key值。同时它也value值，
map不仅有一个key值，还有一个与它相关联的value值，如果你需要另一个，你就需要使用map，如果不需要就使用set

11.6
@http://stackoverflow.com/questions/2302681/c-stl-list-vs-set

List

Searching (linear time).
Inserting, deleting, moving (takes constant time).
Elements may be ordered.
Elements may be sorted.
Elements may be duplicate.


Set

Searching (logarithmic in size).
Insert and delete (logarithimic in general).
Elements are un-ordered.
Elements are always sorted from lower to higher.
Elements are unique.

11.7

#include <iostream>
#include <map>
#include <string>
#include <algorithm>
#include <vector>

using std::string;
using std::vector;
using std::map;
using std::cin;
using std::cout;
using std::endl;


using Families = map<string, vector<string>>;

Families make_families()
{
    Families families;
    string in1,in2;
    cout << "姓：" << endl;
    cin >> in1;
    cout << "孩子:" << endl;
    while (cin >> in2) {
        families[in1].push_back(in2);

    }
    return families;
}

int main() {
    auto mf = make_families();
    for (const auto &a : mf) {
        cout << "姓"<<a.first << ":\n";
        for (const auto &b : a.second) {
            cout << b << " ";
        }
    }

    return 0;
}

11.8
@Yue Wang Sep

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

int main()
{
    std::vector<std::string> exclude = { "aa", "bb", "cc", "dd", "ee", "ff" };
    for (std::string word; std::cout << "Enter plz:\n", std::cin >> word; )
    {
        auto is_excluded = std::binary_search(exclude.cbegin(), exclude.cend(), word);
        auto reply = is_excluded ? "excluded" : "not excluded";
        std::cout << reply << std::endl;
    }

    return 0;
}