zoukankan      html  css  js  c++  java
  • Weekly Contest 78-------->811. Subdomain Visit Count (split string with space and hash map)

    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.

    Approach #1: C++.

    class Solution {
    public:
        vector<string> subdomainVisits(vector<string>& cpdomains) {
            unordered_map<string, int> mp;
            vector<string> ans;
            for (int i = 0; i < cpdomains.size(); ++i) {
                istringstream iss(cpdomains[i]);
                string s;
                vector<string> temp;
                while (getline(iss, s, ' ')) {
                    temp.push_back(s.c_str());
                }
                int num = stoi(temp[0]);
                string str = temp[1];
                temp.clear();
                istringstream jss(str);
                
                // get the subdomains
                stack<string> stk;
                while (getline(jss, s, '.')) {
                    stk.push(s.c_str());
                }
                s = stk.top();
                stk.pop();
                while (!stk.empty()) {
                    mp[s] += num;
                    s = stk.top() + '.' + s;
                    stk.pop();
                }
                mp[s] += num;
            }
            for (auto it = mp.begin(); it != mp.end(); ++it) {
                string mario = to_string(it->second) + ' ' + it->first;
                ans.push_back(mario);
            }
            return ans;
        }
    };
    

      

    In this question I learned how to split string using istringstream and string splice. then stroe the substring with unordered_map.

    永远渴望,大智若愚(stay hungry, stay foolish)
  • 相关阅读:
    回流与重绘
    事件循环的一些小啰嗦
    async与await的那些事儿
    数组去重的方法们
    Object的一些常用方法
    JS事件流的一些理解
    关于Ajax的那些记录
    call、bind与apply函数的区别
    继承的一些细碎记载
    计算机基础的小贴士(1)
  • 原文地址:https://www.cnblogs.com/h-hkai/p/9973445.html
Copyright © 2011-2022 走看看