# 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.

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

``````class Solution {
public:
vector<string> subdomainVisits(vector<string>& cpdomains) {
vector<string> res;
unordered_map<string, int> subdomainCnt;
for (string cpdomain : cpdomains) {
int spaceIdx = cpdomain.find(" ");
int cnt = stoi(cpdomain.substr(0, spaceIdx));
while (spaceIdx != string::npos) {
subdomainCnt[cpdomain.substr(spaceIdx + 1)] += cnt;
spaceIdx = cpdomain.find('.', spaceIdx + 1);
}
}
for (auto a : subdomainCnt) {
res.push_back(to_string(a.second) + " " + a.first);
}
return res;
}
};
``````

https://leetcode.com/problems/subdomain-visit-count/solution/

https://leetcode.com/problems/subdomain-visit-count/discuss/157942/C++-concise-solution

https://leetcode.com/problems/subdomain-visit-count/discuss/121738/C++JavaPython-Easy-Understood-Solution

LeetCode All in One 题目讲解汇总(持续更新中…)

 微信打赏 Venmo 打赏
（欢迎加入博主的知识星球，博主将及时答疑解惑，并分享刷题经验与总结，试运营期间前五十位可享受半价优惠～）

×

Help us with donation