如何在不使用“|"的情况下将两组连接在一行中
问题描述
假设 S
和 T
被分配了集合.如果不使用连接运算符 |
,我如何找到这两个集合的并集?例如,这会找到交集:
Assume that S
and T
are assigned sets. Without using the join operator |
, how can I find the union of the two sets? This, for example, finds the intersection:
S = {1, 2, 3, 4}
T = {3, 4, 5, 6}
S_intersect_T = { i for i in S if i in T }
那么如何在不使用 |
的情况下在一行中找到两个集合的并集?
So how can I find the union of two sets in one line without using |
?
解决方案
集合可以使用union方法:set.union(other_set)
You can use union method for sets: set.union(other_set)
请注意,它返回一个新集合,即它不会自行修改.
Note that it returns a new set i.e it doesn't modify itself.
相关文章