leetcode题解之分解字符串域名

1、题目描述

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.

原题： https://leetcode.com/problems/subdomain-visit-count/description/

题目的意思是输入一个字符串向量，每个字符串代表一个域名和访问这个域名的次数，统计将域名拆分之后。所有的的域名的访问次数。

2、题目分析

由于输入的每个字符串都是string，因此应该考虑先将字符串拆分，然后使用一个unorder_map<string,int>统计每个子域名出现的次数。

3、代码

 vector<string> subdomainVisits(vector<string>& cpdomains) {
         // 思路可以将字符串先分割，然后使用 unorder_set 计数
         // 使用一个子函数将每个cpdomains 分割

         unordered_map<string,int> m;

         for(auto Itr = cpdomains.begin() ; Itr != cpdomains.end(); Itr++ )
         {
             vector<string> Sproc = split_cpdomains(*Itr);
             for(auto itr = Sproc.begin() + ; itr != Sproc.end(); itr++ )
             {
                 m[*itr] += stoi(Sproc[]);
             }
         }

         vector<string> ans;
         for(auto it = m.begin() ; it != m.end(); it++ )
         {
             ans.push_back( to_string(it->second) +" "+ it->first );
         }

         return ans;

     }

     vector<string> split_cpdomains(string & s)
     {
         vector<string> res;

         int i = ;
         for(auto itr = s.begin() ; itr != s.end() ; itr++)   // 以下代码可以用 string 的find() 成员函数简化
         {
             i++;
             if( *itr == ' ')
             {
                 res.push_back( s.substr(,i )); // put number in
                 break;
             }
         }

         res.push_back( s.substr( s.find_first_of(' ') +  )) ;
         res.push_back(  s.substr(s.find_first_of(".") + ));
         if( s.find_first_of(".") != s.find_last_of(".") )
             res.push_back( s.substr( s.find_last_of(".") + ) ) ;

         return res;
     }