Algorithms-and-Data-Structures/Leetcode Problems/Medium/811-Subdomain-Visit-Count.py at main · aish21/Algorithms-and-Data-Structures · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
'''
A website domain "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.

A count-paired domain is a domain that has one of the two formats "rep d1.d2.d3" or "rep d1.d2" where rep is the number of visits to the domain and d1.d2.d3 is the domain itself.

For example, "9001 discuss.leetcode.com" is a count-paired domain that indicates that discuss.leetcode.com was visited 9001 times.
Given an array of count-paired domains cpdomains, return an array of the count-paired domains of each subdomain in the input. You may return the answer in any order.
'''

class Solution:
    def subdomainVisits(self, cpdomains: List[str]) -> List[str]:
        cnt = collections.Counter()
        for dom in cpdomains:
            count, domain = dom.split(" ")
            count = int(count)
            cnt[domain] += count
            for j, k in enumerate(domain):
                if k == '.':
                    cnt[domain[j + 1 : ]] += count
        return [str(count) + " " + domain for domain, count in cnt.items()]