zoukankan      html  css  js  c++  java
  • leetcode884

    class Solution {
    public:
        void SplitString(const string& s, vector<string>& v, const string& c)
        {
            string::size_type pos1, pos2;
            pos2 = s.find(c);
            pos1 = 0;
            while (string::npos != pos2)
            {
                v.push_back(s.substr(pos1, pos2 - pos1));
    
                pos1 = pos2 + c.size();
                pos2 = s.find(c, pos1);
            }
            if (pos1 != s.length())
                v.push_back(s.substr(pos1));
        }
        vector<string> uncommonFromSentences(string A, string B) {
            vector<string> X;
            map<string, int> M;
    
            vector<string> V1;        
            SplitString(A, V1, " ");
            for (auto str : V1)
            {
                if (M.find(str) == M.end())//未找到此值
                {
                    M.insert(make_pair(str, 1));
                }
                else
                {
                    M[str]++;
                }
            }
    
            vector<string> V2;
            SplitString(B, V2, " ");
            for (auto str : V2)
            {
                if (M.find(str) == M.end())//未找到此值
                {
                    M.insert(make_pair(str, 1));
                }
                else
                {
                    M[str]++;
                }
            }
    
            for (auto m : M)
            {
                if (m.second == 1)
                {
                    X.push_back(m.first);
                }
            }
            return X;
        }
    };
  • 相关阅读:
    杂记-2
    2019CSP-S游记
    csp2020
    特征根法小记
    csp模拟赛低级错误及反思
    备份
    黑科技——树剖两次dfs转一次dfs!
    输出天干地支
    蓝桥0531-输出Y
    蓝桥0615-判断四位数字前后两组是否相等
  • 原文地址:https://www.cnblogs.com/asenyang/p/9716612.html
Copyright © 2011-2022 走看看