[leetcode] 811. Subdomain Visit Count

[leetcode] 811. Subdomain Visit Count

Description

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.

分析

题目的意思是：给定一些域名和请求次数，求子域名的访问数量。

一个字符串分割的问题，注意c++里面的字符串分割。然后这就是一个字符串分割统计的题目。

代码

class Solution {public: vector subdomainVisits(vector& cpdomains) { unordered_map m; for(auto c:cpdomains){ int i=c.find(" "); int cnt=stoi(c.substr(0,i)); string s=c.substr(i+1); for(int i=0;i res; for(auto a:m ){ res.push_back(to_string(a.second)+" "+a.first); } return res; }};

参考文献

​​811. Subdomain Visit Count​​

版权声明：本文内容由网络用户投稿，版权归原作者所有，本站不拥有其著作权，亦不承担相应法律责任。如果您发现本站中有涉嫌抄袭或描述失实的内容，请联系我们jiasou666@gmail.com 处理，核实后本网站将在24小时内删除侵权内容。