Anagrams by Stack
来源:互联网 发布:html语言软件 编辑:程序博客网 时间:2024/05/02 01:48
Total Submit: 1561 Accepted Submit: 649
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]
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:
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:
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
madamadammbahamabahamalongshortericrice
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 ]
My Solution
#include <stdio.h>
#include <string.h>
#define MAX_LEN 100
void CheckSequence(char* Array, int Length, char* Start, char* End)
{
char Temp[MAX_LEN], Output[MAX_LEN];
int i, input_pos = 0, output_pos = 0;
for(i = 0; i < Length; i++){
if(Array[i] == 'i'){
Temp[input_pos++] = *Start++;
}else if(Array[i] == 'o'){
if(input_pos == 0) return;
input_pos --;
Output[output_pos++] = Temp[input_pos];
}
}
Output[output_pos++] = 0;
if(strcmp(Output, End) == 0){
for(i = 0; i < Length; i++) printf("%c ", Array[i]);
putchar('/n');
}
}
void swap(char* v1, char* v2)
{
char temp;
temp = *v1; *v1 = *v2; *v2 = temp;
}
int main()
{
char Start[MAX_LEN], End[MAX_LEN], Array[MAX_LEN*2];
int Length, startpos, currpos;
int i, j, k, temp;
while(scanf("%s%s", Start, End) > 0){
puts("[");
Length = strlen(Start);
for(i = 0; i < Length; i++){
Array[i] = 'i';
Array[i + Length] = 'o';
}
Array[2*Length] = 0;
CheckSequence(Array, 2 * Length, Start, End);
startpos = 2 * Length - 1;
while(1){
for(i = startpos; i >= 0; i--)
if(Array[i] == 'i') break;
if(i < 0) break;
for(j = i + 1; j < 2 * Length; j++)
if(Array[j] == 'o'){
swap(&Array[i], &Array[j]);
temp = startpos;
for(i = 2 * Length - 1; i >= startpos; i--){
if(Array[i] == 'i'){
for(k = j + 1; k < i; k++){
if(Array[k] == 'o'){
swap(&Array[i], &Array[k]);
temp = i;
break;
}
}
}
}
startpos = temp;
CheckSequence(Array, 2 * Length, Start, End);
break;
}
if(j == 2 * Length) startpos--;
}
puts("]");
}
return 0;
}
Runtime: 00:00.00
Run memory: 388K
- 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
- 留言本
- ADO.NET 概述
- 爱因斯坦谜语的编程解法思路
- 岁月的童话
- 整理硬盘找出来滴东东-Delphi代码生成器
- Anagrams by Stack
- C语言之extern声明辨析
- 3G移动增值业务发展分析
- 图腾是什么
- 期刊
- 构造特殊字符来进行渗透入侵
- 2006互联网技术展望
- C++中extern “C”含义深层探索
- 获取cpu序列号,硬盘ID,网卡MAC地址