作者: 负雪明烛
id: fuxuemingzhu
个人博客: http://fuxuemingzhu.cn/


题目地址: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.

Example 1:

  1. Input:
  2. ["9001 discuss.leetcode.com"]
  3. Output:
  4. ["9001 discuss.leetcode.com", "9001 leetcode.com", "9001 com"]
  5. Explanation:
  6. 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:

  1. Input:
  2. ["900 google.mail.com", "50 yahoo.com", "1 intel.mail.com", "5 wiki.org"]
  3. Output:
  4. ["901 mail.com","50 yahoo.com","900 google.mail.com","5 wiki.org","5 org","1 intel.mail.com","951 com"]
  5. Explanation:
  6. 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:

  1. The length of cpdomains will not exceed 100.
  2. The length of each domain name will not exceed 100.
  3. Each address will have either 1 or 2 “.” characters.
  4. The input count in any count-paired domain will not exceed 10000.

题目大意

互联网在访问某个域名的时候也会访问其上层域名,现在告诉你访问该域名的次数,统计所有域名被访问的次数。

解题方法

字典统计次数

这个题逻辑并不复杂,就是使用字典来保存每个域名被访问的次数。有点难点的地方是要得到每个域名及其所有上级域名,我使用的while循环和字符串切片来完成这个操作。

代码:

  1. class Solution(object):
  2. def subdomainVisits(self, cpdomains):
  3. """
  4. :type cpdomains: List[str]
  5. :rtype: List[str]
  6. """
  7. domain_counts = collections.defaultdict(int)
  8. for cpdomain in cpdomains:
  9. times, domains = cpdomain.split()
  10. times = int(times)
  11. domain_counts[domains] += times
  12. while '.' in domains:
  13. domains = domains[domains.index('.') + 1:]
  14. domain_counts[domains] += times
  15. return [str(v) + ' ' + d for d, v in domain_counts.items()]

二刷的时候基本同样的方法,但是并没有每次都去更改子域名,而是使用了遍历的方式。

  1. class Solution:
  2. def subdomainVisits(self, cpdomains):
  3. """
  4. :type cpdomains: List[str]
  5. :rtype: List[str]
  6. """
  7. count = collections.Counter()
  8. for cpdomain in cpdomains:
  9. times, domain = cpdomain.split(" ")
  10. times = int(times)
  11. count[domain] += times
  12. for i, c in enumerate(domain):
  13. if c == '.':
  14. count[domain[i + 1 : ]] += times
  15. return [str(times) + " " + domain for domain, times in count.items()]

日期

2018 年 4 月 2 日 —— 要开始准备ACM了
2018 年 11 月 6 日 —— 腰酸背痛要废了

【LeetCode】811. Subdomain Visit Count 解题报告(Python)的更多相关文章

  1. LeetCode 811 Subdomain Visit Count 解题报告

    题目要求 A website domain like "discuss.leetcode.com" consists of various subdomains. At the t ...

  2. LeetCode 811. Subdomain Visit Count (子域名访问计数)

    题目标签:HashMap 题目给了我们一组域名,让我们把每一个域名,包括它的子域名,计数. 遍历每一个域名,取得它的计数,然后把它的所有子域名和它自己,存入hashmap,域名作为key,计数作为va ...

  3. 811. Subdomain Visit Count - LeetCode

    Question 811. Subdomain Visit Count Example 1: Input: ["9001 discuss.leetcode.com"] Output ...

  4. 【Leetcode_easy】811. Subdomain Visit Count

    problem 811. Subdomain Visit Count solution: class Solution { public: vector<string> subdomain ...

  5. [LeetCode&Python] Problem 811. Subdomain Visit Count

    A website domain like "discuss.leetcode.com" consists of various subdomains. At the top le ...

  6. 811. Subdomain Visit Count (5月23日)

    解答 class Solution { public: vector<string> subdomainVisits(vector<string>& cpdomains ...

  7. 【LeetCode】62. Unique Paths 解题报告(Python & C++)

    作者: 负雪明烛 id: fuxuemingzhu 个人博客: http://fuxuemingzhu.cn/ 题目地址:https://leetcode.com/problems/unique-pa ...

  8. 811. Subdomain Visit Count

    这题主要难在构建关联容器,方法很多,但是核心都是把原字符串一截一截减下来处理,先把前面用空格隔开的次数转化为整数,然后处理后面的多层子域. 方法一,查找标志字符,用标志字符把字符串分成几段 stati ...

  9. 【LeetCode】911. Online Election 解题报告(Python)

    [LeetCode]911. Online Election 解题报告(Python) 作者: 负雪明烛 id: fuxuemingzhu 个人博客: http://fuxuemingzhu.cn/ ...

随机推荐

  1. PDFium 渲染

    PDFium 是 Chromium 的 PDF 渲染引擎,许可协议为 BSD 3-Clause.不同于 Mozilla 基于 HTML5 的 PDF.js,PDFium 是基于 Foxit Softw ...

  2. 日常Java 2021/10/24

    Java ArrrayList ArrayList类是一个可以动态修改的数组,没有固定大小的限制,可以在任何时候添加或者删除元素 ArrayList类在java.util包中使用之前需要引用 E:泛型 ...

  3. 大厂高频面试题Spring Bean生命周期最详解

    Spring作为当前Java最流行.最强大的轻量级框架.Spring Bean的生命周期也是面试高频题,了解Spring Bean周期也能更好地帮助我们解决日常开发中的问题.程序员应该都知道Sprin ...

  4. 【Reverse】DLL注入

    DLL注入就是将dll粘贴到指定的进程空间中,通过dll状态触发目标事件 DLL注入的大概流程 https://uploader.shimo.im/f/CXFwwkEH6FPM0rtT.png!thu ...

  5. pyqt5 改写函数

    重新改写了keyPressEvent() class TextEdit(QTextEdit): def __init__(self): QtWidgets.QTextEdit.__init__(sel ...

  6. c学习 - 第七章:数组

    7.3.6 字符串处理函数 (1).puts(字符数组) 字符串输出到终端 (2).gets(字符数组) 从标准输入获取字符串(包括空格) (3).strcat(字符数组1,字符数组2) 连接两个字符 ...

  7. Output of C++ Program | Set 3

    Predict the output of below C++ programs. Question 1 1 #include<iostream> 2 using namespace st ...

  8. 'this' pointer in C++

    The 'this' pointer is passed as a hidden argument to all nonstatic member function calls and is avai ...

  9. NGNIX 开启socket分发的使用配置

    worker_processes 1; #error_log logs/error.log; #error_log logs/error.log notice; #error_log logs/err ...

  10. Mongodb单点部署

    目录 一.依赖和环境 二.部署 三.启动和测试 一.依赖和环境 centos7.2,4核cpu, 8G内存 100G硬盘 版本:3.4.7社区版本 端口:27017 数据目录:/usr/local/m ...