811. Subdomain Visit Count Medium

1/**
2 * [811] Subdomain Visit Count
3 *
4 * 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.
5 * 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.
6 * 
7 * 	For example, "9001 discuss.leetcode.com" is a count-paired domain that indicates that discuss.leetcode.com was visited 9001 times.
8 * 
9 * 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.
10 *  
11 * Example 1:
12 * 
13 * Input: cpdomains = ["9001 discuss.leetcode.com"]
14 * Output: ["9001 leetcode.com","9001 discuss.leetcode.com","9001 com"]
15 * Explanation: We only have one website domain: "discuss.leetcode.com".
16 * As discussed above, the subdomain "leetcode.com" and "com" will also be visited. So they will all be visited 9001 times.
17 * 
18 * Example 2:
19 * 
20 * Input: cpdomains = ["900 google.mail.com", "50 yahoo.com", "1 intel.mail.com", "5 wiki.org"]
21 * Output: ["901 mail.com","50 yahoo.com","900 google.mail.com","5 wiki.org","5 org","1 intel.mail.com","951 com"]
22 * Explanation: We will visit "google.mail.com" 900 times, "yahoo.com" 50 times, "intel.mail.com" once and "wiki.org" 5 times.
23 * For the subdomains, we will visit "mail.com" 900 + 1 = 901 times, "com" 900 + 50 + 1 = 951 times, and "org" 5 times.
24 * 
25 *  
26 * Constraints:
27 * 
28 * 	1 <= cpdomain.length <= 100
29 * 	1 <= cpdomain[i].length <= 100
30 * 	cpdomain[i] follows either the "repi d1i.d2i.d3i" format or the "repi d1i.d2i" format.
31 * 	repi is an integer in the range [1, 10^4].
32 * 	d1i, d2i, and d3i consist of lowercase English letters.
33 * 
34 */
35pub struct Solution {}
36
37// problem: https://leetcode.com/problems/subdomain-visit-count/
38// discuss: https://leetcode.com/problems/subdomain-visit-count/discuss/?currentPage=1&orderBy=most_votes&query=
39
40// submission codes start here
41
42impl Solution {
43    pub fn subdomain_visits(cpdomains: Vec<String>) -> Vec<String> {
44        vec![]
45    }
46}
47
48// submission codes end
49
50#[cfg(test)]
51mod tests {
52    use super::*;
53
54    #[test]
55    fn test_811() {
56    }
57}
58