class Solution:
def minimumLengthEncoding(self, words: List[str]) -> int:
good =set(words) #想用discard,remove如果没有会报错
for word in words:
for k in range(1, len(word)): #尾数要是一致则去除
good.discard(word[k:])
return sum(len(word) + 1 for word in good)#可以直接计算
return min(set(fronts+backs)-{i for i, j in zip(fronts, backs) if i == j} or {0}) 前面建立set,集合,后面也是集合。如果i==j,则输出i的集合,或是0
class Solution:
def numFactoredBinaryTrees(self, A: List[int]) -> int:
A.sort()
d = {} #建立字典
for num in A:
d[num] = 1 #字典为一
for z in d: #寻求字典的key
if not num%z and num//z in d: #not num%z指的是后者不为0,而且num//z在d中
d[num] += d[z]*d[num//z] #动态规划 相当于左右两边的数相乘后再乘以2,再加一
return sum(d.values())%(10**9+7) #相当于d的值的总和