- Notifications
You must be signed in to change notification settings - Fork 6
/
Copy pathq19.py
15 lines (13 loc) · 554 Bytes
/
q19.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
# 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.
a= [1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 13, 13, 13, 13, 12]
b= [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 13, 13, 13]
c= []
forninb:
ifninb:
ifnnotinc:
c.append(n)
print(c)