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

 

思路：

 

 

1.使用stringstream读入字符串，再分别输出整形变量访问次数cnt和字符串域名s，然后使用map<string，int> mp记录各域名的累计次数，最后输出时，也可以使用字符串流读入，在输出到vector<string>中或者直接使用to_string()转换即可。

参考代码：

class Solution {
public:
    map<string,int> mp;
    string s;
    stringstream stream;
    int cnt;
    vector<string> st;
    vector<string> subdomainVisits(vector<string>& cpdomains) {
        for(int i=0;i<cpdomains.size();i++){
            stream.clear();
            s.clear();
            stream<<cpdomains[i];
            stream>>cnt>>s;
            while(s.size()>0){
                mp[s]+=cnt;
               if(s.find('.')!=-1) 
                   s=s.substr(s.find('.')+1);
                else break;
            }
        }
        map<string,int>::iterator it;
        for(it=mp.begin();it!=mp.end();it++)
        {       
            st.push_back(to_string(it->second)+" "+it->first);
        }
        return st;
    }
};

 

优化：

1.使用string.find()找到空格，然后string.substr(0，空格的位置)得到前面的数字，再将数字转化成整型，同样的可求得后面的域名字符串，后续如上。

 

参考代码：

class Solution {
public:
    map<string,int> mp;
    string s;
    vector<string> st;
    vector<string> subdomainVisits(vector<string>& cpdomains) {
        for(int k=0;k<cpdomains.size();k++){
            s=cpdomains[k];
            int i=s.find(" ");
            int n=stoi(s.substr(0,i));
            s=s.substr(i+1);
            while(s.size()>0){
                mp[s]+=n;
               if(s.find('.')!=-1) 
                   s=s.substr(s.find('.')+1);
                else s="";
            }
        }
        map<string,int>::iterator it;
        for(it=mp.begin();it!=mp.end();it++)
        {       
            st.push_back(to_string(it->second)+" "+it->first);
        }
        return st;
    }
};