[LeetCode] 811. Subdomain Visit Count

A website domain like "discuss.leetcode.com" consists of various subdomains. At the top level, we have "com", at the next level, we have "leetcode.com", and at the lowest level, "discuss.leetcode.com". When we visit a domain like "discuss.leetcode.com", we will also visit the parent domains "leetcode.com" and "com" implicitly.

Now, call a "count-paired domain" to be a count (representing the number of visits this domain received), followed by a space, followed by the address. An example of a count-paired domain might be "9001 discuss.leetcode.com".

We are given a list cpdomains of count-paired domains. We would like a list of count-paired domains, (in the same format as the input, and in any order), that explicitly counts the number of visits to each subdomain.

Example 1:
Input: 
["9001 discuss.leetcode.com"]
Output: 
["9001 discuss.leetcode.com", "9001 leetcode.com", "9001 com"]
Explanation: 
We only have one website domain: "discuss.leetcode.com". As discussed above, the subdomain "leetcode.com" and "com" will also be visited. So they will all be visited 9001 times.

Example 2:
Input: 
["900 google.mail.com", "50 yahoo.com", "1 intel.mail.com", "5 wiki.org"]
Output: 
["901 mail.com","50 yahoo.com","900 google.mail.com","5 wiki.org","5 org","1 intel.mail.com","951 com"]
Explanation: 
We will visit "google.mail.com" 900 times, "yahoo.com" 50 times, "intel.mail.com" once and "wiki.org" 5 times. For the subdomains, we will visit "mail.com" 900 + 1 = 901 times, "com" 900 + 50 + 1 = 951 times, and "org" 5 times.

Notes:

• The length of cpdomains will not exceed 100.
• The length of each domain name will not exceed 100.
• Each address will have either 1 or 2 "." characters.
• The input count in any count-paired domain will not exceed 10000.
• The answer output can be returned in any order.

---

分两步，
第一步将域名字符串分解成子域名，每次从.的右边一位substr到字符串的末尾就行了
第二步计数，使用map

void subDomain(string domain, int count, map<string,int> *_map)
{
    (*_map)[domain] += count;
    for(int i = 0; i < domain.size(); i++)
    {
        if (domain.at(i) == '.')
        {
            (*_map)[domain.substr(i+1)] += count;
        }
    }
}

vector<string> subdomainVisits(vector<string>& cpdomains)
{
    map<string,int> _map;
    vector<string> result;
    int count;
    string domain;
    for(int i = 0; i < cpdomains.size(); i++)
    {
        stringstream ss(cpdomains.at(i));

        ss >> count >> domain;
        subDomain(domain, count, &_map);
    }

    for (map<string,int>::iterator iter = _map.begin(); iter != _map.end(); iter++)
    {
        result.push_back(to_string(iter->second) + " " + iter->first);
    }

    return result;
}

然而这个解法代码长而且不是最优解，看看LeetCode上其他的解法

也是一样的思路，但代码要精简，没有使用stringstream，直接遍历字符串取出num和domain

vector<string> subdomainVisits(vector<string>& cpdomains) {
    vector<string> res;
    unordered_map<string, int> m;
    for (string str : cpdomains) {
        int num = 0, i = 0, n = str.size();
        while (str[i] != ' ') num = num * 10 + str[i++] - '0';
        m[str.substr(++i)] += num;
        for ( ; i < n; i++)
            if (str[i] == '.') m[str.substr(i+1)] += num;
    }
    for (auto e : m)
        res.push_back(to_string(e.second) + " " + e.first);
    return res;
}

转载于:https://www.cnblogs.com/arcsinw/p/9492680.html