//測(cè)試構(gòu)造
	void test_Construct() {
    set<int> s1;//普通構(gòu)造
    
   //迭代器構(gòu)造
   //數(shù)組
    int arr[] = { 2,2,1,1,5,5,5,1,7,9,8,10 };
    set<int> s2(arr,arr+sizeof(arr)/sizeof(int));    //默認(rèn)就是升序
    cout << "s2: ";
    for (auto it : s2) {
        cout << it << " ";
    }
    cout << endl;
	//vector
    vector<int> v = { 2,2,1,1,5,5,5,1,7,9,8,10 };
    set<int> s3(v.begin(), v.end());    //默認(rèn)就是升序
    cout << "s3: ";
    for (auto it : s3) {
        cout << it << " ";
    }
    cout << endl;

    //拷貝構(gòu)造
    set<int> s4(s3);
    cout << "s4: ";
    for (auto it : s3) {
        cout << it << " ";
    }
    cout << endl;
}

void test_cmp() {
    //set 降序
    set<int, less<int>> s1;
    s1.insert(3);
    s1.insert(5);
    s1.insert(2);
    s1.insert(6);
    s1.insert(7);
    s1.insert(10);
    s1.insert(9);
    s1.insert(1);
    s1.insert(4);
    s1.insert(8);
    cout << "升序：s1: ";
    for (auto it : s1) {
        cout << it << " ";
    }
    cout << endl;

    //set升序
    set<int, greater<int>> s2;
    s2.insert({3,5,2,6,7,10,9,1,4,8});
    cout << "降序：s2: ";
    for (auto it : s2) {
        cout << it << " ";
    }
    cout << endl;
}

	void test() {
    set<int, greater<int>> s1;
    s1.insert({ 3,5,2,6,7,10,9,1,4,8 });

    cout << "有效數(shù)據(jù)的個(gè)數(shù)： " << s1.size() << endl;
    cout << "是否為空容器：  " << s1.empty() << endl;
    //在set中意義不大的函數(shù)
    cout << "容器中元素3出現(xiàn)了：  " << s1.count(3) << endl;
    set<int>:: iterator it = s1.find(2);        //找到則返回這個(gè)元素的迭代器，沒(méi)找到，則返回end（）
    cout <<"find(2): "<< * it << endl;

    set<int, greater<int>> s2;
    s2.insert({ 1,5,8 });

    cout << "交換前："<<endl;
    cout << "s1: ";
    for (auto it : s1) {
        cout << it << " ";
    }
    cout << endl;

    cout << "s2: ";
    for (auto it : s2) {
        cout << it << " ";
    }
    cout << endl;

    swap(s1, s2);

    cout << "交換后：" << endl;
    cout << "s1: ";
    for (auto it : s1) {
        cout << it << " ";
    }
    cout << endl;

    cout << "s2: ";
    for (auto it : s2) {
        cout << it << " ";
    }
    cout << endl;

    s1.clear();
    cout << "清除：s1: ";
    for (auto it : s1) {
        cout << it << " ";
    }
    cout << endl;
}

template <typename T1, typename T2> 
struct pair {
    T1 first;		//鍵
    T2 second;		//值
    pair() : first(), second() {}
    pair(const T1& x, const T2& y): first(x), second(y) {}
    template <typename U1, typename U2>
    pair(const pair<U1, U2>& p) : first(p.first), second(p.second) {}
    pair& operator=(const pair& rhs) {
        if (this != &rhs) {
            first = rhs.first;
            second = rhs.second;
        }
        return *this;
    }
};

	void test_map() {
    // 構(gòu)造空的map
    map<string, int> map1;
    cout << "map1:" << endl;
    for (auto it : map1) {
        cout << it.first << it.second << endl;
    }
    cout << endl;

    // 使用初始化列表構(gòu)造
    map<string, string> map2{
        {"apple", "蘋(píng)果"},
        {"banana", "香蕉"},
        {"orange", "橘子"}
    };
    cout << "map2:" << endl;
    for (auto it : map2) {
        cout << it.first << it.second << endl;
    }
    cout << endl;

    // 構(gòu)造map并插入元素
    map<string, int> map3;
    map3.insert(pair<string, int>("panda", 1));
    map3.insert(make_pair("", 2));
    map3.insert(map<string, int>::value_type("monkey", 3));
    cout << "map3:" << endl;
    for (auto it : map3) {
        cout << it.first << it.second << endl;
    }
    cout << endl;
    cout << "空格對(duì)應(yīng)的值:" << map3[""];
}

	void test() {
    std::map<std::string, int> my_map;
    my_map["apple"] = 2;
    my_map["banana"] = 3;
    cout << "my_map 變化前" << endl;
    for (auto it : my_map) {
        cout << it.first << " : " << it.second << endl;
    }
    cout << endl;

    std::cout << my_map["apple"] << std::endl; // 輸出 2
    std::cout << my_map["pear"] << std::endl;  // 輸出默認(rèn)值 0

    cout << "my_map 變化后" << endl;
    for (auto it : my_map) {
        cout << it.first << " : " << it.second << endl;
    }
    cout << endl;

}

class Solution {
public:
    vector<int> intersection(vector<int>& nums1, vector<int>& nums2) {
        vector<int> ret;    //用于返回結(jié)構(gòu)的數(shù)組
        //先通過(guò)set去重
        set<int> s1;
        for(int& it:nums1){
            s1.insert(it);
        }

        set<int> s2;
        for(int& it:nums2){
            s2.insert(it);
        }

        for(auto& it:s1){
            if(s2.count(it)){    //表示s1中的值在s2中可以找到
                ret.push_back(it);
            }
        }
        return ret;
    }
};

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

int main() {
    string sentence;
    getline(cin, sentence);
    //全部轉(zhuǎn)化為小寫(xiě)
    for (auto& it : sentence) {
        if (it >= 'A' && it <= 'Z') {
            it += 32;
        }
    }
    auto left = sentence.begin();
    auto right = left;
    map<string, int, less<string>> m;
    for (int i = 0; i < sentence.size(); i++) {
        right = sentence.begin();
        if (sentence[i] == ' ' || sentence[i] == '.')
        {
            right += i;
            string word(left, right);
            left = right + 1;
            m[word]++;
        }
    }

    for (auto& it : m) {
        cout << it.first << ":" << it.second << endl;
    }
    return 0;
}