doraemon1293 最近的时间轴更新 doraemon1293 最近的时间轴更新 |
doraemon1293V2EX 第 187686 号会员，加入于 2016-08-18 18:15:48 +08:00 |
doraemon1293 最近回复了
252 天前 回复了 goagent 创建的主题 › 全球工单系统 › 搜狗的同学看过来，请问你们是怎么做到的，为什么卸载你们的全家桶，还是删不了这个文件夹 SogouExplorer |
用 unlocker 试试
2018-12-12 18:24:19 +08:00 回复了 zealinux 创建的主题 › Python › 求教 Python 合并元组算法 |
union find
```
from collections import defaultdict
class DSU:
def __init__(self):
self.weights = {}
self.parents = {}
def find(self, x):
if x not in self.parents:
self.parents[x] = x
self.weights[x] = 1
return x
else:
path = [x]
while self.parents[path[-1]] != path[-1]:
path.append(self.parents[path[-1]])
root = path[-1]
for node in path:
self.parents[node] = root
return root
def union(self, elements):
roots = [self.find(e) for e in elements]
heaviest_root = max([(self.weights[root], root) for root in roots])[1]
for root in roots:
if root != heaviest_root:
self.weights[heaviest_root] += self.weights[root]
self.parents[root] = heaviest_root
def merger(A):
"""
:type A: List[int]
:rtype: int
"""
dsu = DSU()
for a in A:
dsu.union(a)
d=defaultdict(set)
for k,x in dsu.parents.items():
d[x].add(k)
return list(d.values())
```
```
from collections import defaultdict
class DSU:
def __init__(self):
self.weights = {}
self.parents = {}
def find(self, x):
if x not in self.parents:
self.parents[x] = x
self.weights[x] = 1
return x
else:
path = [x]
while self.parents[path[-1]] != path[-1]:
path.append(self.parents[path[-1]])
root = path[-1]
for node in path:
self.parents[node] = root
return root
def union(self, elements):
roots = [self.find(e) for e in elements]
heaviest_root = max([(self.weights[root], root) for root in roots])[1]
for root in roots:
if root != heaviest_root:
self.weights[heaviest_root] += self.weights[root]
self.parents[root] = heaviest_root
def merger(A):
"""
:type A: List[int]
:rtype: int
"""
dsu = DSU()
for a in A:
dsu.union(a)
d=defaultdict(set)
for k,x in dsu.parents.items():
d[x].add(k)
return list(d.values())
```
2018-12-12 18:18:25 +08:00 回复了 zealinux 创建的主题 › Python › 求教 Python 合并元组算法 |
没仔细看题,,,,忽略我写的吧..
2018-12-12 18:17:10 +08:00 回复了 zealinux 创建的主题 › Python › 求教 Python 合并元组算法 |
set(itertools.chain(*arr))
2018-07-13 16:57:01 +08:00 回复了 hoxis 创建的主题 › Python › Python for 循环中的陷阱 |
一句话总结 ()的出来的 express comprehension 是 generator 不是 tuple
2018-03-22 18:33:15 +08:00 回复了 qxy 创建的主题 › 程序员 › 刚打算入门学习算法，遇到一题发现 PHP 果然是最好的语音 |
随手一写竟然 timecost 排第一。。。。
class Solution:
"""
@param: dictionary: an array of strings
@return: an arraylist of strings
"""
def longestWords(self, dictionary):
# write your code here
ans=[]
longest=0
for word in dictionary:
if len(word)>longest:
ans=[word]
longest=len(word)
elif len(word)==longest:
ans.append(word)
return ans
class Solution:
"""
@param: dictionary: an array of strings
@return: an arraylist of strings
"""
def longestWords(self, dictionary):
# write your code here
ans=[]
longest=0
for word in dictionary:
if len(word)>longest:
ans=[word]
longest=len(word)
elif len(word)==longest:
ans.append(word)
return ans
2018-01-31 18:38:01 +08:00 回复了 suyuanhxx 创建的主题 › 职场话题 › 怎样才能获得出国工作的机会？ |
@binux 老哥现在在英国哪里工作 我也在英国 能给个内推吗
无脑买腾讯和阿里就行了..
2017-07-17 16:33:29 +08:00 回复了 eddiewithyou 创建的主题 › 程序员 › 麻痹，黑马培训机构的学员写的代码！真爱生命远离培训班！！！ |
@msg7086 你有病吧 谁惜得管你写什么 是你自己要求这么写的 还写了一堆话来证明自己正确 回头又否定自己
2017-07-15 17:27:51 +08:00 回复了 eddiewithyou 创建的主题 › 程序员 › 麻痹，黑马培训机构的学员写的代码！真爱生命远离培训班！！！ |
@msg7086 嗯嗯嗯 说得对 以后这种问题你就这么写
Select Language