1 Star 0 Fork 0

yuhang2__2/LeetCode-Solutions

加入 Gitee
与超过 1200万 开发者一起发现、参与优秀开源项目,私有仓库也完全免费 :)
免费加入
文件
克隆/下载
subdomain-visit-count.py 743 Bytes
一键复制 编辑 原始数据 按行查看 历史
Allen Liu 提交于 7年前 . update
# Time: O(n), is the length of cpdomains (assuming the length of cpdomains[i] is fixed)
# Space: O(n)
import collections
class Solution(object):
def subdomainVisits(self, cpdomains):
"""
:type cpdomains: List[str]
:rtype: List[str]
"""
result = collections.defaultdict(int)
for domain in cpdomains:
count, domain = domain.split()
count = int(count)
frags = domain.split('.')
curr = []
for i in reversed(xrange(len(frags))):
curr.append(frags[i])
result[".".join(reversed(curr))] += count
return ["{} {}".format(count, domain) \
for domain, count in result.iteritems()]
Loading...
马建仓 AI 助手
尝试更多
代码解读
代码找茬
代码优化
1
https://gitee.com/yuhang2__2/LeetCode-Solutions.git
git@gitee.com:yuhang2__2/LeetCode-Solutions.git
yuhang2__2
LeetCode-Solutions
LeetCode-Solutions
master

搜索帮助