【Leetcode_easy】811. Subdomain Visit Count

problem

811. Subdomain Visit Count

solution:

class Solution {
public:
    vector<string> subdomainVisits(vector<string>& cpdomains) {
        vector<string> res;
        unordered_map<string, int> subdomain;
        int spaceIdx = 0;
        for(auto cpdomain:cpdomains)
        {
            spaceIdx = cpdomain.find(" ");//errrrr...
            int cnt = stoi(cpdomain.substr(0, spaceIdx));
            string tmp = cpdomain.substr(spaceIdx+1);
            for(int i=0; i<tmp.size(); ++i)
            {
                if(tmp[i]=='.') subdomain[tmp.substr(i+1)] += cnt;//errr.
            }
            subdomain[tmp] += cnt;//err..
        }
        for(auto sub:subdomain)
        {
            res.push_back(to_string(sub.second) + " " + sub.first);//errr...
        }
        return res;
    }
};

参考

1. Leetcode_easy_811. Subdomain Visit Count;

2. Grandyang;

完