摘要:
问题:How can anagrams result from sequences of stack operations? There are two sequences of stack operators which can convert TROT to TORT:[i i i i o o o oi o i i o o i o]whereistands for Push andostands for Pop. Your program should, given pairs of words produce sequences of stack operations which con 阅读全文
posted @ 2011-06-25 12:03
skyline0623
阅读(227)
评论(0)
推荐(0)

浙公网安备 33010602011771号