C#LeetCode刷题之#811-子域名访问计数（Subdomain Visit Count）

问题

该文章的最新版本已迁移至个人博客【比特飞】，单击链接 https://www.byteflying.com/archives/3814 访问。

一个网站域名，如"discuss.leetcode.com"，包含了多个子域名。作为顶级域名，常用的有"com"，下一级则有"leetcode.com"，最低的一级为"discuss.leetcode.com"。当我们访问域名"discuss.leetcode.com"时，也同时访问了其父域名"leetcode.com"以及顶级域名 "com"。

给定一个带访问次数和域名的组合，要求分别计算每个域名被访问的次数。其格式为访问次数+空格+地址，例如："9001 discuss.leetcode.com"。

接下来会给出一组访问次数和域名组合的列表cpdomains 。要求解析出所有域名的访问次数，输出格式和输入格式相同，不限定先后顺序。

输入: ["9001 discuss.leetcode.com"]

输出: ["9001 discuss.leetcode.com", "9001 leetcode.com", "9001 com"]

说明: 例子中仅包含一个网站域名："discuss.leetcode.com"。按照前文假设，子域名"leetcode.com"和"com"都会被访问，所以它们都被访问了9001次。

输入: ["900 google.mail.com", "50 yahoo.com", "1 intel.mail.com", "5 wiki.org"]

输出: ["901 mail.com","50 yahoo.com","900 google.mail.com","5 wiki.org","5 org","1 intel.mail.com","951 com"]

说明: 按照假设，会访问"google.mail.com" 900次，"yahoo.com" 50次，"intel.mail.com" 1次，"wiki.org" 5次。而对于父域名，会访问"mail.com" 900+1 = 901次，"com" 900 + 50 + 1 = 951次，和 "org" 5 次。

注意事项：

cpdomains 的长度小于 100。
每个域名的长度小于100。
每个域名地址包含一个或两个"."符号。
输入中任意一个域名的访问次数都小于10000。

---

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.

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.

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.

---

示例

该文章的最新版本已迁移至个人博客【比特飞】，单击链接 https://www.byteflying.com/archives/3814 访问。

public class Program {

    public static void Main(string[] args) {
        var cpdomains = new string[] { "9001 discuss.leetcode.com" };

        var res = SubdomainVisits(cpdomains);
        ShowArray(res);

        Console.ReadKey();
    }

    private static void ShowArray(IList array) {
        foreach(var domain in array) {
            Console.Write($"{domain} ");
        }
        Console.WriteLine();
    }

    private static IList SubdomainVisits(string[] cpdomains) {
        var dic = new Dictionary();
        foreach(var domain in cpdomains) {
            var split = domain.Split(' ');
            var num = int.Parse(split[0]);
            var subDomains = GetSubDomains2(split[1]);
            foreach(var item in subDomains) {
                if(dic.ContainsKey(item)) {
                    dic[item] += num;
                } else {
                    dic[item] = num;
                }
            }
        }
        return dic.Select(r => r.Value + " " + r.Key).ToList();
    }

    private static List GetSubDomains(string domain) {
        var res = new List();
        var domains = domain.Split('.');
        for(var i = 0; i < domains.Length; i++) {
            var dom = string.Empty;
            for(var j = i; j < domains.Length; j++) {
                dom += "." + domains[j];
            }
            res.Add(dom.TrimStart('.'));
        }
        return res;
    }

    private static List GetSubDomains2(string domain) {
        var res = new List();
        for(var i = domain.Length - 1; i >= 0; i--) {
            if(domain[i] == '.' || i == 0) {
                res.Add(domain.Substring(i).TrimStart('.'));
            }
        }
        return res;
    }

}

以上给出1种算法实现，以下是这个案例的输出结果：

该文章的最新版本已迁移至个人博客【比特飞】，单击链接 https://www.byteflying.com/archives/3814 访问。

9001 discuss.leetcode.com 9001 leetcode.com 9001 com

---

分析：

设原问题规模为 n，域名的最大长度为 m，若获取子域名采用 GetSubDomains 方法，那么以上算法的时间复杂度为：  ；

若获取子域名采用 GetSubDomains2 方法，则以上算法的时间复杂度为：  。