python中求两个List的交集、并集和差集 直接上代码,有三种方法,第三种调用库函数效率最高 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 # ! /usr/bin/env python # encoding:utf-8 if _...
>>> print(list(set(a).intersection(set(b))) [3] 1. 2. 3. 4. 或者 >>> [x for x in a if x in b] [3] 1. 2. 2.3 两个list的差集 >>> a = [1, 2, 3] >>> b = [3, 4, 5] >>> list(set(b).difference(set(a))) [4, 5] >>> list(set(a).difference(set(b...
2、效率较高的、并且可以去除重复数据的做法: >>> a=[1,2,3,4,5,6,7,8,9,10]>>> b=[1,2,3,4,5]>>> intersection=list(set(a).intersection(set(b)))>>>intersection [1, 2, 3, 4, 5]>>> union=list(set(a).union(set(b)))>>>union [1, 2, 3, 4, 5, 6, 7, 8, 9,...
2. list