RosettaCodeData/Task/Doubly-linked-list-Traversal/Python/doubly-linked-list-traversal-2.py

6 lines
147 B
Python
Raw Permalink Normal View History

2013-04-10 16:57:12 -07:00
l = [ 10, 20, 30, 40 ]
for i in l:
print(i)
for i in reversed(l): # reversed produces an iterator, so only O(1) memory is used
print(i)