list_test = [
[
[1,2,3],
[4,5,6]
],
[
[7,8,9]
]
]
# 三层也是同样的道理
[x for i in list_test for j in i for x in j]
输出结果:
i in a for i in b结构
# 查找字典交集
def intersect_dicts(da, db, exclude=()):
# Dictionary intersection of matching keys and shapes, omitting 'exclude' keys, using da values
# 返回da和db中的键一样的 值的shape一样的 如果有exclude这个可能就清空了即返回的字典可能是个空字典
return {k: v for k, v in da.items() if k in db and not any(x in k for x in exclude)}
a = {'name': "jjw", "age": 18, "sex": 'boy'}
b = {'name': "jjw", "age": 19, "height": 175}
print(intersect_dicts(a, b))
print(intersect_dicts(a, b, 'age'))
c = [1, 2, 3, 4, 5]
d = [1, 2, 5, 6]
print([i in c for i in d]) # 意思就是判断c中的每个元素是否也在d中
print(any([i in c for i in d])) # 任何一个成立就成立
print(not any([i in c for i in d])) # 所有都不成立才返回TRUE
e = [7, 8, 9]
print(not any([i in c for i in e])) # 所有都不成立才返回TRUE
直接看例子 两层遍历a = [[1],[2],[3],[4],[5]][x for i in a for x in i]输出结果: 总结:从最终的输出结果来看第一个x代表着最终的输出,从左向右第一个for是对a的最外层的遍历 第二个for是对第二层的遍历即对i的遍历,但是输出是根据第二层的x进行输出的三层遍历也是同样的原理list_test = [ [ [1,2,3], [4,5,6] ], [ [7,8,9]