[Tutor] html checker
alan.gauld at btinternet.com
Tue Oct 2 01:46:31 CEST 2012
On 01/10/12 20:59, Matthew Dalrymple wrote:
> i don't really understand the pop and push or even stacks for that
> matter...the professor i have isn't really the best at teaching...so if
> anyone could give me a hand with any of this that would be appreciated
The Raw materials topic in my tutor has a short intro to stacks. It
says, in part:
Think of a stack of trays in a restaurant. A member of staff puts a pile
of clean trays on top and these are removed one by one by customers. The
trays at the bottom of the stack get used last (and least!). Data stacks
work the same way: you push an item onto the stack or pop one off. The
item popped is always the last one pushed. This property of stacks is
sometimes called Last In First Out or LIFO. One useful property of
stacks is that you can reverse a list of items by pushing the list onto
the stack then popping it off again. The result will be the reverse of
the starting list. Stacks are not built in to Python, VBScript or
behavior. Lists are usually the best starting point since like stacks
they can grow as needed.
As c smith points out, Python lists have a pop/push mechanism as
standard which makes implementing a stack in Python fairly trivial.
To expand on how reversing works consider pushing the string foo onto
the stack then popping it off again:
s = 'foo'
stack = 
stack.push(s) # stack -> ['f']
stack.push(s) # stack -> ['o','f']
stack.push(s) # stack -> ['o','o','f']
c1 = stack.pop() # stack -> ['o','f'], c1 = 'o'
c2 = stack.pop() # stack -> ['f'], c1 = 'o', c2 = 'o'
c3 = stack.pop() # stack -> , c1 = 'o', c2 = 'o', c3 = 'f'
print c1+c2+c3 # prints 'oof' the reverse of s
Author of the Learn to Program web site
More information about the Tutor