a={'AAA':'123','BB':'123','C':'1223','DD':'222','EEE':'123'}
# # # 判断一个字典中是否有这些key: ‘AAA’,’BB’,’C’,’DD’,’EEE’(不使用for while)
b=['AAA','BB','C','DD']
a=set(a)
b=set(b)
print('%s存在'%(a&b))
i=0
c=str(a)
def func(a,i):
try:
o=b[i]
oo=repr(o)+":"
print(oo)
print(c)
if oo in a:
print("%s存在"%o)
i+=1
except:
return
func(a,i)
func(c,i)
from functools import reduce
lst = [[1,2,3],[4,5,6],[7,8,9]]
print(list(reduce(lambda x,y:x+y,lst)))
# print(sum(lst,[]))
#
# 输入一个字符串,返回倒序排列的结果:abcdef,返回:fedcba
a='abcdef'
print(a[::-1])
# 已知alsit = [1, 2, 3, 1, 2, 1, 3]
alsit = [1, 2, 3, 1, 2, 1, 3]
print(set(sorted(alsit,key=alsit.index)))
# 将aaabbcccd这种形式的字符串压缩成a3b2c3d1这种形式。
b={}
c=""
a="aaabbcccd"
for i in a:
b[i]=b.get(i,0)+1
for i,t in b.items():
c+=str(i)
c+=str(t)
print(c)