811. Subdomain Visit Count

811. Subdomain Visit Count

---

题目

Leetcode题目

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.

---

解决

1.利用map来处理域名以及相应的访问次数
并且字符串处理时是自左至右。
【n为cpdomains中字符串的个数，m为一个字符串中的最多域名数(n <= m)】

• 时间复杂度：O(n * m)
• 空间复杂度：O(m)

// First Solution (Runtime: 26ms)
class Solution {
public:
    vector<string> subdomainVisits(vector<string>& cpdomains) {
        vector<string> result;
        // use map to store the domain name and the visit times
        map<string, int> domains;
        int num = cpdomains.size();
        for (int i = 0; i < num; i++) {
            // extract the number in the string
            string number = cpdomains[i].substr(0, cpdomains[i].find_first_of(" "));
            // string to int
            int times = atoi(number.c_str());
            int len = cpdomains[i].length();
            int begin = number.length() + 1;
            string domain;
            // extract domain names in the string
            for (int j = begin; j < len; j++) {
                // '.' is the delimiter
                if (cpdomains[i][j] == '.') {
                    domain = cpdomains[i].substr(begin);
                    (domains.find(domain) == domains.end()) ? (domains[domain] = times) : (domains[domain] += times);
                    begin = j + 1;
                }
            }
            domain = cpdomains[i].substr(begin);
            (domains.find(domain) == domains.end()) ? (domains[domain] = times) : (domains[domain] += times);
        }
        for (map<string, int>::iterator it = domains.begin(); it != domains.end(); it++) {
            stringstream ss;
            ss << it->second;
            result.push_back(ss.str() + " " + it->first);
        }
        return result;
    }
};

2.利用unordered_map来处理域名以及相应的访问次数
提取字符串中的域名的时候是自右至左。
利用unordered_map可以减少map插入时排序的时间。
【n为cpdomains中字符串的个数，m为一个字符串中的最多域名数(n <= m)】

• 时间复杂度：O(n * m)
• 空间复杂度：O(m)

// Second Solution (Runtime: 15ms)
class Solution {
public:
    vector<string> subdomainVisits(vector<string>& cpdomains) {
        vector<string> result;
        // use unordered_map to store the domain name and the visit times
        unordered_map<string, int> domains;
        int num = cpdomains.size();
        for (int i = 0; i < num; i++) {
            int pos = cpdomains[i].find(" ");
            // extract the number in the string and change into int
            int times = atoi(cpdomains[i].substr(0, pos).c_str());
            string dom = cpdomains[i].substr(pos + 1, cpdomains[i].length() - pos - 1);
            // extract domain names in the string
            for (int j = dom.length() - 1; j >= 0; j--) {
                if (j == 0) {
                    domains[dom.substr(0, dom.length())] += times;
                } else if (dom[j] == '.') {
                    domains[dom.substr(j + 1, dom.length() - j - 1)] += times;
                }
            }
        }
        for (unordered_map<string, int>::iterator it = domains.begin(); it != domains.end(); it++) {
            result.push_back(to_string(it->second) + " " + it->first);
        }
        return result;
    }
};