add python set

beginner-fei · beginner-fei · commit bace1b2acd8c · 2019-09-16T15:21:25.000+08:00
add python set
diff --git a/day-015/__init__.py b/day-015/__init__.py
diff --git a/day-015/set.py b/day-015/set.py
@@ -0,0 +1,64 @@
+
+set1 = {'hello', 'hello', 'word', 'word'}
+print(set1)
+
+# 创建空集合
+empty_set = set()
+
+# 创建空字典
+empty_dict = {}
+
+# 集合添加元素
+s = set(('hello','world'))
+print(s)
+
+# 向集合 s 中添加元素
+s.add('!')
+
+print('添加元素后的集合是：%s' % s)
+
+# 使用 update() 方法向集合中添加新元素
+#　1）添加列表
+s.update([1,3],[2,4])
+print('添加元素后的集合是：%s' % s)
+
+# 2）添加元组
+s.update(('h', 'j'))
+print('添加元素后的集合是：%s' % s)
+
+# 移除元素
+# 1） remove(x)
+s.remove(2)
+print('移除元素 2 后的集合是：%s' % s)
+
+# 移除集合中不存在的集合
+#s.remove('hi')
+#print('移除元素后的集合是：%s' % s)
+
+# discard(x) 此方法移除集合中不存在的元素不会报错
+s.discard('hi')
+print('移除元素后的集合是：%s' % s)
+
+
+# 随机删除集合中的一个元素
+print(s)
+
+s.pop()
+
+print('移除元素后的集合是：%s' % s)
+
+
+# 计算集合个数
+print('集合 s 的长度是：%s' % len(s))
+
+
+# 清空集合
+s.clear()
+print('集合清空后的结果是：%s' % s)
+
+
+# 判断元素是否存在
+s = {'hello',  'word'}
+# 判断元素 hello 是否在集合 s 中
+
+print('hello' in s)
diff --git a/day-015/set_difference.py b/day-015/set_difference.py
@@ -0,0 +1,8 @@
+
+# 求两个集合的差集，元素在 x 中不在 y 中
+x = {"apple", "banana", "cherry"}
+y = {"google", "microsoft", "apple"}
+
+z = x.difference(y)
+
+print('两个集合的差集是：%s' % z)
diff --git a/day-015/set_difference_update.py b/day-015/set_difference_update.py
@@ -0,0 +1,16 @@
+
+# 移除两个集合中都存在的元素，无返回值,将 x 中存在的 y 中不存在的留下，将 x 和 y 中都存在的删除，y 中存在和不存在的删除
+x = {"apple", "banana", "cherry"}
+y = {"google", "microsoft", "apple"}
+
+x.difference_update(y)
+
+print(x)
+
+
+x1 = {1,2,3,4}
+y1 = {1,2,3}
+
+x1.difference_update(y1)
+
+print(x1)
diff --git a/day-015/set_intersection.py b/day-015/set_intersection.py
@@ -0,0 +1,16 @@
+
+# 返回两个或者多个集合的交集
+x = {"apple", "banana", "cherry"}
+y = {"google", "runoob", "apple"}
+
+z = x.intersection(y)
+
+print(z)
+
+#　返回三个集合的交集
+x = {"a", "b", "c"}
+y = {"c", "d", "e"}
+z = {"f", "g", "c"}
+
+result = x.intersection(y, z)
+print('三个集合的差集是：%s' % result)
diff --git a/day-015/set_intersection_update.py b/day-015/set_intersection_update.py
@@ -0,0 +1,15 @@
+# 返回一个无返回值的集合交集
+x = {"apple", "banana", "cherry"}
+y = {"google", "runoob", "apple"}
+
+x.intersection_update(y)
+
+print(x)
+
+x = {"a", "b", "c"}
+y = {"c", "d", "e"}
+z = {"f", "g", "c"}
+
+x.intersection_update(y, z)
+
+print(x)
diff --git a/day-015/set_isdisjoint.py b/day-015/set_isdisjoint.py
@@ -0,0 +1,15 @@
+x = {"apple", "banana", "cherry"}
+y = {"google", "runoob", "apple"}
+#　判断集合 y 中是否包含集合 x 中的元素，如果没有返回 True, 有则返回 False
+z = x.isdisjoint(y)
+# 结果返回 False,说明集合 y 中有和 x 中相同的元素
+print(z)
+
+
+
+x = {"apple", "banana", "cherry"}
+y = {"google", "runoob", "baidu"}
+#　判断集合 y 中是否包含集合 x 中的元素，如果没有返回 True, 有则返回 False
+z = x.isdisjoint(y)
+# 结果返回 True,说明集合 y 中没有和 x 中相同的元素
+print(z)
diff --git a/day-015/set_issubset.py b/day-015/set_issubset.py
@@ -0,0 +1,15 @@
+
+# 判断集合 x 的所有元素是否都包含在集合 y 中：
+x = {"a", "b", "c"}
+y = {"f", "e", "d", "c", "b", "a"}
+
+z = x.issubset(y)
+
+print(z)
+
+x = {"a", "b", "c"}
+y = {"f", "e", "d", "c", "b","y"}
+
+z = x.issubset(y)
+
+print(z)
diff --git a/day-015/set_issuperset.py b/day-015/set_issuperset.py
@@ -0,0 +1,14 @@
+x = {"f", "e", "d", "c", "b", "a"}
+y = {"a", "b", "c"}
+
+z = x.issuperset(y)
+
+print(z)
+
+# 如果没有全部包含返回 False：
+x = {"f", "e", "d", "c", "b"}
+y = {"a", "b", "c"}
+
+z = x.issuperset(y)
+
+print(z)
diff --git a/day-015/set_symmetric_difference.py b/day-015/set_symmetric_difference.py
@@ -0,0 +1,8 @@
+
+# 返回两个集合组成的新集合，但会移除两个集合的重复元素：
+x = {"apple", "banana", "cherry"}
+y = {"google", "runoob", "apple"}
+
+z = x.symmetric_difference(y)
+
+print(z)
diff --git a/day-015/set_union.py b/day-015/set_union.py
@@ -0,0 +1,19 @@
+# 合并两个集合，重复元素只会出现一次：
+
+x = {"apple", "banana", "cherry"}
+y = {"google", "runoob", "apple"}
+
+z = x.union(y)
+
+print(z)
+
+
+# 合并多个集合：
+
+x = {"a", "b", "c"}
+y = {"f", "d", "a"}
+z = {"c", "d", "e"}
+
+result = x.union(y, z)
+
+print(result)
diff --git a/day-015/symmetric_difference_update.py b/day-015/symmetric_difference_update.py
@@ -0,0 +1,8 @@
+
+# 在原始集合 x 中移除与 y 集合中的重复元素，并将不重复的元素插入到集合 x 中：
+x = {"apple", "banana", "cherry"}
+y = {"google", "runoob", "apple"}
+
+x.symmetric_difference_update(y)
+
+print(x)
