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 ofi ando 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, eachi ando 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:
Pop - to retrieve the most recently pushed item
We will use the symbol i (in) for push ando (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 sequencei i o i o o produce the anagram OOF. So also would the sequencei i i o o o. You are to write a program to input pairs of words and output all the valid sequences ofi ando 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
]
Source: Zhejiang University Local Contest 2001
题意:i 代表进栈,o代表出栈,构造出所要求输出单词的进出栈顺序
主要算法:回溯法(用递归思想)
感悟:认真回味递归思想
代码:
#include<iostream> #include<vector> #include<stack> #include <string> using namespace std; int length; string a,b;//源单词和目标单词 stack <char>build;//构造目标字符串 vector<char>operate;//记录出入栈操作 //形参iPush记录入栈操作的次数,形参iPop记录出栈操作的次数 void dfs(int iPush ,int iPop) { // 当出入栈的次数刚好为源单词的长度,目标单词构造完毕,输出操作序列 if(iPush == length && iPop == length) { for(int i = 0; i< operate.size();i++) { cout<<operate[i]<<" "; } cout<<endl; } //入栈操作 if(iPush + 1<= length) { build.push(a[iPush]); operate.push_back('i'); dfs(iPush+1,iPop); build.pop(); operate.pop_back();//恢复入栈操作 } //出栈操作 if(iPop+1<=iPush && iPop + 1<= length && build.top() ==b[iPop]) { char tc = build.top(); build.pop(); operate.push_back('o'); dfs(iPush,iPop+1); build.push(tc);//恢复刚刚出栈的字符,便于下一个搜索 operate.pop_back();//恢复出栈操作 } } int main() { while(cin>>a>>b) { length = a.length(); cout<<"["<<endl; dfs(0,0); cout<<"]"<<endl; } return 0; }主要是学会递归。