-
Notifications
You must be signed in to change notification settings - Fork 30
Expand file tree
/
Copy path811.SubdomainVisitCount.py
More file actions
68 lines (61 loc) · 2.92 KB
/
811.SubdomainVisitCount.py
File metadata and controls
68 lines (61 loc) · 2.92 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
"""
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:
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:
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.
"""
#Difficulty: Easy
#52 / 52 test cases passed.
#Runtime: 52 ms
#Memory Usage: 14 MB
#Runtime: 52 ms, faster than 71.86% of Python3 online submissions for Subdomain Visit Count.
#Memory Usage: 14 MB, less than 100.00% of Python3 online submissions for Subdomain Visit Count.
class Solution:
def subdomainVisits(self, cpdomains: List[str]) -> List[str]:
domains = {}
for d in cpdomains:
visitors, domain = d.split(' ')
if domain not in domains:
domains[domain] = 0
domains[domain] += int(visitors)
while '.' in domain:
domain = domain[domain.index('.')+1:]
if domain not in domains:
domains[domain] = 0
domains[domain] += int(visitors)
return [str(visitors) + ' ' + domain for domain, visitors in domains.items()]