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
in one line of Python using at least one list comprehension.
(Hint: Remember list comprehensions from Exercise 7).
The original formulation of this exercise said to write the solution using one line of Python, but a few readers pointed out that this was impossible to do without using
sets that I had not yet discussed on the blog, so you can either choose to use the original directive and read about the
set command in Python 3.3, or try to implement this on your own and use at least one list comprehension in the solution.
Concepts for this week:
We already discussed list comprehensions in Exercise 7, but they can be made much more complicated.
At the end of this piece of code,
allproducts will contain the list
[5, 10, 15, 10, 20, 30, 15, 30, 45]. So you can put multiple for loops inside the comprehension. But you can also add more complicated conditionals:
[5, 15, 15, 45] because only the odd products are added to the list.
In general, the list comprehension takes the form:
as shown in the examples above.
Try to use the Python random documentation to figure out how to generate a random list. As a hint look below:
This line of code will leave
a containing a list of 5 random numbers from 0 to 99.
Forgot how to submit exercises?