zoukankan      html  css  js  c++  java
  • 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.

    注意 . 是特殊字符需要转义  \.

    time: O(N), space: O(N)

    class Solution {
        public List<String> subdomainVisits(String[] cpdomains) {
            Map<String, Integer> map = new HashMap<>();
            for(String s : cpdomains) {
                String[] cp = s.split(" ");
                int cnt = Integer.parseInt(cp[0]);
                String[] domains = cp[1].split("\.");
                
                StringBuilder sb = new StringBuilder(domains[domains.length - 1]);
                map.put(sb.toString(), map.getOrDefault(sb.toString(), 0) + cnt);
                for(int i = domains.length - 2; i >= 0; i--) {
                    sb.insert(0, ".").insert(0, domains[i]);
                    map.put(sb.toString(), map.getOrDefault(sb.toString(), 0) + cnt);
                    
                }
            }
            
            List<String> res = new ArrayList<>();
            for(String domain : map.keySet()) {
                StringBuilder sb = new StringBuilder();
                sb.append(map.get(domain)).append(" ").append(domain);
                res.add(sb.toString());
            }
            return res;
        }
    }
  • 相关阅读:
    机器学习之——正规方程法
    机器学习之——学习率
    机器学习之梯度下降法
    机器学习之线性回归算法
    集体智慧编程学习笔记——第一讲
    机器学习之归一化和标准化总结
    推荐系统实战-学习笔记第一章
    洛谷P1396 营救 题解
    洛谷P3905 道路重建
    洛谷P2384 最短路 题解
  • 原文地址:https://www.cnblogs.com/fatttcat/p/10208212.html
Copyright © 2011-2022 走看看