Anagrams by Stack（深度优先搜索）
摘要：
ZOJ Problem Set - 1004Anagrams by StackTime Limit:2 Seconds Memory Limit:65536 KBHow 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 progra 阅读全文
posted @ 2013-07-24 00:42 铁树银花 阅读(536) 评论(0) 推荐(0) 编辑
