In algorithms/python, you can use a list to implement a stack and it is highly effecient, as to add an item you do list.[...] , and to delete an item you do list.[...] , both operations are O(1).
^^ NOTE: the two occlusions above are each a different answer!
Answer
list.append(item) to push/add list.pop() to pop/delete
Question
In algorithms/python, you can use a list to implement a stack and it is highly effecient, as to add an item you do list.[...] , and to delete an item you do list.[...] , both operations are O(1).
^^ NOTE: the two occlusions above are each a different answer!
Answer
?
Question
In algorithms/python, you can use a list to implement a stack and it is highly effecient, as to add an item you do list.[...] , and to delete an item you do list.[...] , both operations are O(1).
^^ NOTE: the two occlusions above are each a different answer!
Answer
list.append(item) to push/add list.pop() to pop/delete
If you want to change selection, open document below and click on "Move attachment"
pdf
owner: kkhosravi - (no access) - PYTHON_DATA_STRUCTURES_AND_ALGORITHMS.pdf, p135
Summary
status
not learned
measured difficulty
37% [default]
last interval [days]
repetition number in this series
0
memorised on
scheduled repetition
scheduled repetition interval
last repetition or drill
Details
No repetitions
Discussion
Do you want to join discussion? Click here to log in or create user.