Leetcode——811. Subdomain Visit Count

题目原址

https://leetcode.com/problems/subdomain-visit-count/description/

题目描述

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.

Example1：

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.

Example2：

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.

Note：

• 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.

解题思路

该题主要是使用split函数来对字符串进行分割，首先将字符串数组提取出来成为一个一个字符串，然后对每个字符串以“ ”和“.”进行分割。 “”是用来分割出域名的次数，“.”用来分割域名。

先来说明一个split的功能：

public String[] split(String regex)：根据给定正则表达式的匹配拆分此字符串
该方法的作用就像是使用给定的表达式和限制参数()来调用两参数split方法。注意：所得说租中不包括结尾空子串
参数regex：是定界正则表达式
返回值：字符串数组，它是根据给定正则表达式的匹配拆分此字符串确定的。

解题过程：

• 使用增强for循环，循环字符串数组，每得到一个字符串，就将它用“”分割成两个字符串，放在字符数组中。
• 找到每一个字符串的第一个空格之前的次数，将其放在count变量中。
• 然后把字符数组中第二个元素每一个域名按照运算符“,” 分开，将结果放在字符串数组中。
• 对每一个分割出来的字符串数组进行遍历，注意从后向前遍历。如果得到的数组是第一个数组，则将其直接放在temp变量中，否则将其与前一个temp变量连接起来存放在temp中。
• 判断map中是否有这个域名temp，如果没有，则直接放在map中，并将得到的count访问次数直接放进去；否则，需要将访问次数+前一个域名的访问次数
• 最后通过增强for循环将map中的键值放在返回集合list中，因为返回的集合不仅需要字符串，还需要访问次数，所以要把访问次数与字符串拼接起来再添加到list中。

AC代码

class Solution {
    public List<String> subdomainVisits(String[] cpdomains) {
        List<String> list = new ArrayList<String>();
        Map<String,Integer> map = new HashMap<String, Integer>();

        for(String s: cpdomains) {
            String[] oneString = s.split(" ");
            //找到每一个字符串的第一个空格之前的次数
            int count = Integer.valueOf(oneString[0]);
            //把每一个域名按照.运算符分隔开
            String[] stringArray = oneString[1].split("\\.");
            String temp = "";
            for(int i = stringArray.length - 1; i >= 0; i--) {
                temp = stringArray[i] + (temp == "" ? "" : "." + temp);

                if(!map.containsKey(temp)) {
                    map.put(temp, count);
                }else{
                    map.put(temp, count + map.get(temp));
                }
            }
        }

        for(String s: map.keySet()) {
            list.add(map.get(s) + " " + s);
        }
        return list;
    }
}