[合集] M$ interview question# JobHunting - 待字闺中
h*g
1 楼
☆─────────────────────────────────────☆
throttle (天心*地火) 于 (Sun Oct 29 21:15:44 2006) 提到:
Design an efficient algorithm to sort elements in a stack in either
ascending/descending order, using only pop(), top(), push(), isEmpty(),
isFull(). Do not use any auxiliary stacks or arrays.
☆─────────────────────────────────────☆
freelong (不够时间好好来恨你) 于 (Sun Oct 29 21:33:03 2006) 提到:
整天几个破字符串,破stack在这里排来排去.
☆─────────────────────────────────────☆
suyazjm (Hunter) 于 (Sun Oct 29 21:35:43 2006
throttle (天心*地火) 于 (Sun Oct 29 21:15:44 2006) 提到:
Design an efficient algorithm to sort elements in a stack in either
ascending/descending order, using only pop(), top(), push(), isEmpty(),
isFull(). Do not use any auxiliary stacks or arrays.
☆─────────────────────────────────────☆
freelong (不够时间好好来恨你) 于 (Sun Oct 29 21:33:03 2006) 提到:
整天几个破字符串,破stack在这里排来排去.
☆─────────────────────────────────────☆
suyazjm (Hunter) 于 (Sun Oct 29 21:35:43 2006