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:
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.
Approach
C++
#include <bits/stdc++.h>using namespace std;vector<string> subdomainVisits(vector<string> &cpdomains){unordered_map<string, int> mp;for (auto i : cpdomains){int x = i.find(" ");int n = stoi(i.substr(0, x));string s = i.substr(x + 1);for (int i = 0; i < s.size(); ++i)if (s[i] == '.')mp[s.substr(i + 1)] += n;mp[s] += n;}vector<string> res;for (auto it = mp.begin(); it != mp.end(); it++)res.push_back(to_string(it->second) + " " + it->first);return res;}int main(){vector<string> cpdomains = {"900 google.mail.com","50 yahoo.com","1 intel.mail.com","5 wiki.org"};vector<string> res = subdomainVisits(cpdomains);cout << "[";for (int i = 0; i < res.size(); i++){cout << res[i];if (i != res.size() - 1)cout << ", ";}cout << "]";return 0;}
No comments:
Post a Comment