Leetcode 811. Subdomain Visit Count(Java)

问题描述

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 1:
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 2:
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.

解决方案

package test ;

import java.lang.* ;
import java.util.*;

class Solution {
    public List<String> subdomainVisits(String[] cpdomains) {
        Map<String, Integer> counts = new HashMap<String, Integer>() ; //存储对应的字符串和出现的次数

        for(String domain : cpdomains){
            String[] info = domain.split("\\s+") ; //将cpdomains分成了次数和域名info[0]是次数,info[1]是域名
            String[] dom = info[1].split("\\.") ; //将域名按照“.”分开

            int times = Integer.valueOf(info[0]) ;
            String temp = "" ;
            for(int i = dom.length - 1; i >= 0; i --){
                temp = dom[i] + (i == dom.length - 1? "": ".") + temp ;
                counts.put(temp, counts.getOrDefault(temp, 0) + times) ;
                /*Integer java.util.Map.getOrDefault(Object key, Integer defaultValue)
                Returns the value to which the specified key is mapped, or defaultValue if this map contains no mapping for the key.*/

            }
        }
        //存储结果
        List<String> result = new ArrayList<String>() ;
        for(String s : counts.keySet()){
            result.add("" + counts.get(s) + " " + s) ;
        }
        return result ;
    }
}

public class Test{
    public static void main(String[] args){
        Solution s = new Solution() ;

        String[] cpdomains = {"900 google.mail.com", "50 yahoo.com", "1 intel.mail.com", "5 wiki.org"} ;

        System.out.println(s.subdomainVisits(cpdomains)) ;
    }   
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值