释义 |
- 1
The list of directories ACTS like a stack — you push a directory onto the top of the stack, and pop a directory off the top again to get it back. 该目录列表的行为就像一个堆栈——您将一个目录压入堆栈顶部,并从顶部弹出一个目录以取回它。 - 2
If the character is an operator, pop two operands, perform the appropriate operation, and then push the result onto the stack. 如果字符是个操作符,弹出两个操作数,执行恰当操作,然后把结果压入堆栈。 - 3
If you push the Numbers 2, 4, and 6 onto a stack and then pop the stack twice, you will get 6 and 4, in that order. 如果你向堆栈压入数据2,4,6,然后弹出栈两次,你将按照顺序得到6与4。
|