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:
a = [1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89] b = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13]
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.
Extras:
- Randomly generate two lists to test this
In [1]:
#Exercise 10 Main Problem
def main():
a = [1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89]
b = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13]
c = [x for x in set(a) if x in set(b)]
print(c)
if __name__ == '__main__':
main()
In [9]:
#Exercise 10 Main Problem with Extra
import random
def main():
a = random.sample(range(100),5)
print(a)
b = random.sample(range(100),10)
print(b)
c = [x for x in set(a) if x in set(b)]
print(c)
if __name__ == '__main__':
main()