This week’s exercise is going to be revisiting an old exercise (see Exercise 5), except require the solution in a different way.
Take two lists, say for example these two:
and write a program that returns a list that contains only the elements that are common between the lists (without duplicates). Make sure your program works on two lists of different sizes. Write this using at least one list comprehension. (Hint: Remember list comprehensions from Exercise 7).
A user-submitted solution:
As a few commenters / readers of this blog have pointed out (thanks mainly to Gautam and Jeff), the exercise as posed is actually impossible to write in a single line of Python. The problem is this: the proposed reader solution (and the solution that I had in mind myself) as written above does not take into account the fact that there might be duplicates in the resulting list, where I specifically asked to not include duplicates. This means that in the simple example I gave above,
a’s first element is
1 will be added to the
result list because it is in
b. But then it’s next element is also
1, and is also in
b, so will be added to the
result list. So the solution as given (the comprehension
[i for i in a if i in b]) will not yield the correct result on the example solution.
Instead, as pointed out by Gautam and Jeff, the simplest way to achieve this solution would be to make sure that we are only looking at unique elements from
a, the first list in the comprehension. We have not discussed doing this easily in Python on this blog using the
set built-in function, but if you know it, the solution will look like this:
But, to achieve the same results as asked in the original question while still using a list comprehension (however, definitely not using a single line of code), would be to make sure that there is no overlap in the new list after it is constructed, using the traditional
for loop on lists:
Or, to practice list comprehensions again, this can be done with two list comprehensions: