STL

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

/**
*
*判断vector正反向元素是否一样
*/
template<class T>
bool fun1(const vector<T> v) {
    for (int i = 0; i < v.size() / 2; i++) {
        if (v.at(i) != v.at(v.size() - i - 1)) {
            return false;
        }
        else {
            return true;
        }
    }
}

/**
*判断list正反向元素是否一样
*/
template<class T>
bool fun2(const list<T> l) {
    auto start = l.begin();
    auto tail = l.end();
    while (1) {
        tail--;
        if (start == tail) break;
        if ((*start) != (*tail)) {
            return false;
        }
        start++;
        if (start == tail) break;
    }
    return true;
}


template<class T>
void test1(const vector<T>& v) {
    cout << fun1(v) << endl;
}

template<class T>
void test2(const list<T> l) {
    cout << fun2(l) << endl;
}


template<class T>
void test3(vector<T>& v) {

    int n;
    cin >> n;
    T temp;
    for (int i = 0; i < n; i++) {
        cin >> temp;
        v.push_back(temp);
    }
    cout << "Before sort ! " << endl;
    for (auto i : v) {
        cout << i << ' ';
    }
    sort(v.begin(), v.end());
    cout << endl << "After sort ! " << endl;
    for (auto i : v) {
        cout << i << ' ';
    }
    cout << endl << "Please input a number you want to search : ";
    auto ite = v.begin();
    while (cin >> n) {
        if ((ite = find(v.begin(), v.end(), n)) != v.end()) {
            cout << *ite;                                                        /*****/
        }
        else {
            cout << "No find!";
        }
        cout << endl << "Please input a number you want to search : ";
    }
}


/**
*求两个集合的交集
*/
void test4() {
    set<int> s1 = { 9,5,6,3,2,1,8,4,7,1,5,2,4,6,5,4,7,8,5,9,6,4,2 };
    set<int> s2 = { 1,0,10,5,6,4,3,2,8,7,9,100,5,8, 5,8,5,5,8,25, };
    set<int> s3;
    cout << "s1 : ";
    for (auto ele : s1) {
        cout << ele << ' ';
    }
    cout << endl << "s2 : ";
    for (auto ele : s2) {
        cout << ele << ' ';
    }
    cout << endl;
    for (auto ele : s1) {
        if (s2.find(ele) != s2.end()) {
            s3.insert(ele);
        }
    }
    cout << endl << "s3 : ";
    for (auto ele : s3) {
        cout << ele << ' ';
    }
}

/**
*测试map类
*/
void test5() {
    map<string, string> m;
    m.insert(pair<string, string>("zero", "零"));
    m.insert(pair<string, string>("one", "壹"));
    m.insert(pair<string, string>("two", "贰"));
    m.insert(pair<string, string>("three", "叁"));
    m.insert(pair<string, string>("four", "肆"));
    m.insert(pair<string, string>("five", "伍"));
    m.insert(pair<string, string>("six", "陆"));
    m.insert(pair<string, string>("seven", "柒"));
    m.insert(pair<string, string>("eight", "捌"));
    m.insert(pair<string, string>("nine", "玖"));
    m.insert(pair<string, string>("ten", "拾"));
    string key;
    pair<string, string> a;
    while (cin >> key) {
        if (m.find(key) != m.end()) {
            a = *(m.find(key));
            cout << a.second << endl;
        }
        else {
            cout << "No find!" << endl;
        }
    }
}



/**
*计算一个文章中某个单词出现的频率
*/
void test6() {
    map<string, int> m;
    pair<string, int> a;
    pair<std::map<string, string>::iterator, bool> judge;
    vector<string> v;
    string temp;
    int num = 0;
    while (cin >> temp) {
        a.first = temp;
        a.second = 0;
        m.insert(a);
        v.push_back(temp);
    }
    cin.clear();
    for (auto ele : v) {
        m[ele]++;
    }
    cout << "Please input the word you want to see : ";
    while (cin >> temp) {
        cout << m[temp];
        cout << "Please input the word you want to see : ";
    }
}

int main() {
    int a[10] = { 1,2,3,4,5,6 };
    vector<int> v(a, a + 10);
    vector<int> vv;
    list<int> l;
    l.assign(a, a + 10);
    //test1(v);
    //test2(l);
    //test3(vv);
    //test4();
    //test5();
    test6();

}