集合的其他内置方法
1.交叉补集(合到一起之后减去共有的部分=并集减交集)
r = ["hehe","haha","woaini"] v = ["hehe","haha","nishishabi"] p = set(r) y = set(v) print(p.symmetric_difference(y)) print(p^y) {'nishishabi', 'woaini'} {'nishishabi', 'woaini'}
2.print(p.difference_update()) 就是给差集重新赋值
3.print(p.isdisjoint(y)) 判断是否有交集,如果没有则ture
r = ["hehe","haha","woaini"] v = ["hehe","haha","nishishabi"] p = set(r) y = set(v) print(p.isdisjoint(y)) false
4.print(p.issubset(y)) 是否是子集,是则Ture
r = ["hehe","haha","woaini"] v = ["hehe","haha","nishishabi"] p = set(r) y = set(v) print(p.issubset(y))
5.print(p.issuperset(y)) 是否是父集
6.p.update(y) 更新,相对于合集来说不一-样 ,会重新赋值,add只能增加一个值,这个是可以增加多个值 add更新一个值,union不更新
r = ["hehe","haha","woaini"] v = ["hehe","haha","nishishabi"] p = set(r) y = set(v) p.update(y) print(p) {'woaini', 'hehe', 'nishishabi', 'haha'}