811. Subdomain Visit Count

最新推荐文章于 2019-04-19 16:51:21 发布

dxx707099957

最新推荐文章于 2019-04-19 16:51:21 发布

阅读量389

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode 字符串处理

本文链接：https://blog.csdn.net/dxx707099957/article/details/79863105

LeetCode 同时被 2 个专栏收录

145 篇文章

订阅专栏

字符串处理

33 篇文章

订阅专栏

本文介绍了一种通过解析域名字符串并统计各子域名访问次数的方法。利用C++实现了一个解决方案，该方案使用unordered_map来存储不同层级的域名及其对应的访问次数，并通过遍历输入的域名列表来更新这些计数。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

解题思路：对字符串处理，采用键值对放入unordered_map中（unordered_map采用的是哈希表，map用的是红黑树，在查找上，哈希表比红黑树效率高），对空格前的字符串转成整型（采用stoi转化 c++11函数），对空格够的字符串处理，逗号进行分词，分别存储其key和value

class Solution {
public:
    vector<string> subdomainVisits(vector<string>& cpdomains) {
        unordered_map<string, int>d;
        for(auto domain:cpdomains){
            int k=domain.find(' ');
            int c=stoi(domain.substr(0,k));
            string s=domain.substr(k+1,domain.length()-k-1);
            for(int i=s.size()-1;i>=0;i--){
                if(s[i]=='.'){
                    d[s.substr(i+1,s.size()-i)]+=c;
                }
                else if(i==0){
                    d[s]+=c;
                }
            }
        }
        vector<string> val;
        for(auto k:d){
            val.push_back(to_string(k.second)+" "+k.first);
        }
        return val;
    }
};