How Can I Efficiently Find the Intersection of Two Lists in Python?

Finding List Intersection: Boolean AND Operation and Set Intersection

In Python, a common task is to find the intersection of two lists, which results in a new list containing the elements that are common to both input lists. This can be achieved using various methods.

One common approach is to use a logical "AND" operation, which compares each element of the first list to every element of the second list and returns a new list with only the elements that match. However, the "AND" operator in Python does not work directly on lists. It requires the input lists to be converted into logical values, which is problematic in this case.

An alternative approach is to use the set intersection operator (&). Sets are unordered collections of unique elements, so this operation returns a set object containing only the elements that are present in both input lists. To obtain a list from the resulting set, it can be cast to a list using the list() function.

For example:

a = [1,2,3,4,5]
b = [1,3,5,6]
list(set(a) & set(b))

This code will produce the following output:

[1, 3, 5]

Set intersection provides a convenient way to perform list intersection, especially when the order of elements is not important and duplicates are ignored. It efficiently compares sets for common elements and avoids potential issues with logical comparisons on lists.

The above is the detailed content of How Can I Efficiently Find the Intersection of Two Lists in Python?. For more information, please follow other related articles on the PHP Chinese website!