zoukankan      html  css  js  c++  java
  • UVA 156 Ananagrams

    STL的应用

    #include<map>
    #include<cstdio>
    #include<string>
    #include<vector>
    #include<cstring>
    #include<iostream>
    #include<algorithm>
    using namespace std;
    string str, s;
    map<string, int>mp;
    vector<string>V, ans;
    void recordStr(string s){
        //cout << "here" << " " <<  s << endl;
        for(int i = 0;i < s.size();i ++)
            if(s[i] >= 'A' && s[i] <= 'Z') s[i] += 32;
        sort(s.begin(), s.end());
        map<string, int>::iterator it = mp.find(s);
        if(it == mp.end()) mp.insert(pair<string, int>(s, 1));
        else it->second ++;
    }
    bool isOnce(string s){
        for(int i = 0;i < s.size();i ++)
            if(s[i] >= 'A' && s[i] <= 'Z') s[i] += 32;
        sort(s.begin(), s.end());
        map<string, int>::iterator it = mp.find(s);
        return it->second == 1;
    }
    int main(){
        //freopen("in.cpp", "r", stdin);
        while(getline(cin, str, '
    ') && str != "#"){
            //cout << str << endl;
            str += " ";
            for(int i = 0;i < str.size();i ++){
                if(str[i] == ' '){
                    if(s.empty()) continue;
                    recordStr(s);
                    V.push_back(s);
                    s.clear();
                }else s.append(1, str[i]);
            }
            str.clear();
        }
        for(int i = 0;i < V.size();i ++) 
            if(isOnce(V[i])) ans.push_back(V[i]);
        sort(ans.begin(), ans.end());
        for(int i = 0;i < ans.size();i ++) cout << ans[i] << endl;
        return 0;
    }


  • 相关阅读:
    构造 非构造 代码块
    Random 类生成随机数
    JAVA寄存器
    PyCharm配置远程python解释器和在本地修改服务器代码
    Java实现常见的排序算法
    推荐系统冷启动问题解决方案
    AVL树C代码
    AVL树->图解2
    AVL树->图解1
    二叉查找树(Binary Sort Tree)
  • 原文地址:https://www.cnblogs.com/anhuizhiye/p/3933179.html
Copyright © 2011-2022 走看看