集合关系运算 交 差 并

# 交集
aa={'qwe','asd','zxc'}
cc={'uio','qwe'}
aa_and_cc=[]
for i in aa:
    if i in cc:
        aa_and_cc.append(i)
print(aa_and_cc)

aa={'qwe','asd','zxc'}
cc={'uio','qwe',}
print(aa.intersection(cc))
print(aa&cc)

# 差集
aa={'qwe','asd','zxc'}
cc={'uio','qwe',}
print(aa.difference(cc))
print(aa-cc)
# 并集
aa={'qwe','asd','zxc'}
cc={'uio','qwe',}
print(aa.union(cc))
print(aa|cc)
# 补集
aa={'qwe','asd','zxc'}
cc={'uio','qwe',}
print(aa.symmetric_difference(cc))
print(aa^cc)

# 求差集然后更新集合

aa={'qwe','asd','zxc'}
cc={'uio','qwe',}
aa.difference_update(cc)
print(aa)

# 判断是否没有相同子集 有输出false 没有输出 true
aa={'qwe','asd','zxc'}
cc={'uio','qwe',}
s=aa.isdisjoint(cc)
print(s)

# 判断aa<=cc aa集合是否被cc集合包含 包含输出 true 否则 false
cc={'qwe','asd','zxc'}
aa={'qwe'}
print(aa.issubset(cc))

# 判断aa>=cc cc集合是否被aa集合包含 包含输出 true 否则 false
aa={'qwe','asd','zxc'}
cc={'qwe'}
print(aa.issuperset(cc))

# pop随机删除子集 可查看删除的子集
cc={'qwe','asd','zxc'}
p=cc.pop()
print(p)
print(cc)

# 更新集合内子集
cc={'qwe','asd','zxc'}
aa={'www','eeee'}
cc.update(aa)
print(cc)

# 去除重复子集转换成列表
v={'qwe','qwe','asd'}
v=set(v) 
print(v)
t=list(v)
print(t)

print(list(set(v)))