hackerrank DefaultDict Tutorial
2017-11-10 12:01
253 查看
题目:https://www.hackerrank.com/challenges/defaultdict-tutorial/problem
题意:给你n个字符串,然后输入m个字符串ask,对于每个ask输出其位置
思路:defaultdict就相当于C++的map(怎么那么多类似的…),然后可以放各种东西,用来统计
dict[key]:如果访问不存在的key,会有KeyError
dict.get(key):如果不存在的key,会返回None
dict.has_key():不存在返回False
代码:
看评论发现if好像没什么用了…
题意:给你n个字符串,然后输入m个字符串ask,对于每个ask输出其位置
思路:defaultdict就相当于C++的map(怎么那么多类似的…),然后可以放各种东西,用来统计
dict[key]:如果访问不存在的key,会有KeyError
dict.get(key):如果不存在的key,会返回None
dict.has_key():不存在返回False
代码:
''' -*- coding: utf-8 -*- @Author : PlayerGuan @Time : 2017/10/14 23:12 @Software: PyCharm Community Edition @File : main.py ''' from collections import defaultdict n,m = map(int,input().split()) d = defaultdict(list) for i in range(n): s = input() d[s].append(i+1) for i in range(m): x = input() if x in d: print(' '.join(map(str,d[x]))) else: print(-1)
看评论发现if好像没什么用了…
for i in range(m): x = input() print(' '.join(map(str,d[x])) or -1)
相关文章推荐
- Python HackerRank|DefaultDict Tutorial(from collections import defaultdict)
- 5.3.4 defaultdict对象
- 【HackerRank】Manasa and Stones
- 【HackerRank】Ice Cream Parlor
- HackerRank "Maximizing XOR"
- HackerRank "Kitty and Katty"
- hackerrank collections.Counter()
- HackerRank "Square Subsequences" !!!
- HackerRank "Tower Breakers, Again!"
- Hackerrank IsFibo
- HackerRank "Nimble Game"
- D - Satisfactory Pairs HackerRank - pairs-again
- [dfs序 主席树] HackerRank University CodeSprint 3. Simple Tree Counting
- HackerRank - Sherlock and The Beast
- HackerRank - Common Child
- HackerRank初级篇之Grading Students
- Ridiculous question in HackerRank about Day 27
- hackerrank University CodeSprint玩耍记
- [HackerRank University Codesprint]Bob and Ben
- 计数器(counter),有序字典(OrderDict),默认字典(defaultdict),可命名元祖(namedtuple),双向队列(deque),单项队列(deuqe.Queue)