Anagrams by Stack
来源:互联网 发布:matlab画数组 编辑:程序博客网 时间:2024/05/22 17:43
Anagrams by Stack
Time limit: 1 Seconds Memory limit: 32768K
Total Submit: 3113 Accepted Submit: 1264
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 o
i o i i o o i o
]
where i stands for Push and o stands for Pop. Your program should, given pairs of words produce sequences of stack operations which convert the first word to the second.
Input
The input will consist of several lines of input. The first line of each pair of input lines is to be considered as a source word (which does not include the end-of-line character). The second line (again, not including the end-of-line character) of each pair is a target word. The end of input is marked by end of file.
Output
For each input pair, your program should produce a sorted list of valid sequences of i and o which produce the target word from the source word. Each list should be delimited by
[
]
and the sequences should be printed in "dictionary order". Within each sequence, each i and o is followed by a single space and each sequence is terminated by a new line.
Process
A stack is a data storage and retrieval structure permitting two operations:
Push - to insert an item and
Pop - to retrieve the most recently pushed item
We will use the symbol i (in) for push and o (out) for pop operations for an initially empty stack of characters. Given an input word, some sequences of push and pop operations are valid in that every character of the word is both pushed and popped, and furthermore, no attempt is ever made to pop the empty stack. For example, if the word FOO is input, then the sequence:
i i o i o o
is valid, but
i i o
is not (it's too short), neither is
i i o o o i
(there's an illegal pop of an empty stack)
Valid sequences yield rearrangements of the letters in an input word. For example, the input word FOO and the sequence i i o i o o produce the anagram OOF. So also would the sequence i i i o o o. You are to write a program to input pairs of words and output all the valid sequences of i and o which will produce the second member of each pair from the first.
Sample Input
madam
adamm
bahama
bahama
long
short
eric
rice
Sample Output
[
i i i i o o o i o o
i i i i o o o o i o
i i o i o i o i o o
i i o i o i o o i o
]
[
i o i i i o o i i o o o
i o i i i o o o i o i o
i o i o i o i i i o o o
i o i o i o i o i o i o
]
[
]
[
i i o i o i o o
]
- Anagrams by Stack
- Anagrams by Stack
- zoj1004 Anagrams by Stack
- Anagrams by Stack
- Anagrams by Stack dfs
- ZOJ1004 Anagrams by Stack
- Anagrams by Stack
- Anagrams by Stack--zju
- ZOJ1004 Anagrams by Stack
- Anagrams by Stack python
- Anagrams by Stack
- ZOJ1004-Anagrams by Stack
- Anagrams by Stack
- ZOJ1004-Anagrams by Stack
- zoj1004-Anagrams by Stack
- zoj_1004-Anagrams by stack
- zoj1004 Anagrams by Stack
- ZOJ_1004 Anagrams by Stack
- Award版Bios内部结构及加载过程简单说明
- 去年今日
- 真正的IIS永远的后门解密
- Fire Net
- Crashing Balloon
- Anagrams by Stack
- A + B Problem
- Base64 Supermarket - 暈
- PCTFREE, PCTUSED, INITRANS, MAXTRANX, FREELIST PARAMETERS
- what is ITL( Interested Transaction list)
- 很想写以下这本书(C#2.0学习心得),就是没有时间
- (N1744)给C++ 0x标准的大整数库提案 粗略翻译稿
- (N1744)Big Integer Library Proposal for C++0x 粗略翻译稿 双语对照(有什么不妥,请参看原文)
- 欧洲之行-德国杜塞尔多夫