I know how to get an intersection of two flat lists:
b1 = [1,2,3,4,5,9,11,15]
b2 = [4,5,6,7,8]
b3 = [val for val in b1 if val in b2]
or
<
Given:
> c1 = [1, 6, 7, 10, 13, 28, 32, 41, 58, 63]
> c2 = [[13, 17, 18, 21, 32], [7, 11, 13, 14, 28], [1, 5, 6, 8, 15, 16]]
I find the following code works well and maybe more concise if using set operation:
> c3 = [list(set(f)&set(c1)) for f in c2]
It got:
> [[32, 13], [28, 13, 7], [1, 6]]
If order needed:
> c3 = [sorted(list(set(f)&set(c1))) for f in c2]
we got:
> [[13, 32], [7, 13, 28], [1, 6]]
By the way, for a more python style, this one is fine too:
> c3 = [ [i for i in set(f) if i in c1] for f in c2]