作者jimmy5566 (jimmy)
看板Grad-ProbAsk
標題[理工] [資結] stack
時間Tue Feb 8 12:56:10 2011
Assume the string of"abcd"are sequentially push into a stack where element
in the stack can be pop during the period of pushing the letters.What
result is the impossible outcome of the stack permutation?
(A)acdb(B)bdac(C)cadb(D)dbac
這題是單選,可是好像只有(A)可以,其他都不行
有人可以指點一下嗎?感恩!
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 220.143.27.244
推 boy5548:你是對的..題目有問題 02/08 13:19
→ jimmy5566:3q 02/08 18:07