Anagrams by Stack

原创 2006年06月05日 17:23:00
Anagrams by Stack

Time limit: 1 Seconds   Memory limit: 32768K  
Total Submit: 1719   Accepted Submit: 724  

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:

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
]

My Solution

#include <iostream>
#include <string>
#include <set>
#include <vector>
//#include <fstream>

using namespace std;

void findAllPaths(const string& source, unsigned int from, const string& target, unsigned int to, vector<char> stack, string actions, set<string>& paths) {
  if (from < source.length()) {
    stack.push_back(source.at(from++));
    actions.append("i ");
    findAllPaths(source, from, target, to, stack, actions, paths);
  }
 
  while (stack.size() > 0 && to < target.length() && stack[stack.size() - 1] == target.at(to)) {
    stack.pop_back();
    actions.append("o ");
    ++to;
    findAllPaths(source, from, target, to, stack, actions, paths);
  }
 
  if (from == source.length() && to == target.length() && stack.size() == 0 && actions.length() > 0) {
    actions.push_back('/n');
    paths.insert(actions);
  } 
}

int main() {
  string source, target;
 
  //fstream infile("in.txt");
  //cin.rdbuf(infile.rdbuf());
 
  while (cin >> source >> target) { 
    string actions;
    set<string> paths;
    vector<char> stack;
    unsigned int from = 0, to = 0;
   
    findAllPaths(source, from, target, to, stack, actions, paths);
   
    set<string>::iterator pos;
    cout << "[" << endl;
    for (pos = paths.begin(); pos != paths.end(); ++pos) {
      cout << *pos;
    }
    cout << "]" << endl;
  }
 
  //infile.close();
}

=====================================
Problem Source: Zhejiang University Local Contest 2001

ZOJ 1004 Anagrams by Stack 分析与解答

问题:How can anagrams result from sequences of stack operations? There are two sequences of stack oper...
  • skyline0623
  • skyline0623
  • 2011年06月25日 12:03
  • 3775

AnagramsbyStack_1004

1.没有注意i, o后面都是跟随一个空格的。错了两次。先是完全没有空格,然后是最后一个有效数据后以为不用空格 2.没有注意栈在深度搜索的时候数据也要恢复到前一次,才能退出这次操作 #inc...
  • heartrude
  • heartrude
  • 2012年12月07日 18:08
  • 463

Anagrams by Stack(进栈出栈问题)

Anagrams by Stack How can anagrams result from sequences of stack operations? There are two sequenc...
  • u014520745
  • u014520745
  • 2014年12月23日 13:24
  • 315

ZOJ--1004:Anagrams by Stack(dfs)

How can anagrams result from sequences of stack operations? There are two sequences of stack operato...
  • yf224
  • yf224
  • 2017年06月06日 22:56
  • 237

ZOJ_1004_AnagramsByStack

Anagrams by Stack Time Limit: 2 Seconds      Memory Limit: 65536 KB How can anagrams result ...
  • baidu_29410909
  • baidu_29410909
  • 2015年08月09日 17:39
  • 495

TOJ 1183 HDU 1515 ZOJ 1004 Anagrams by Stack /深搜+栈

Anagrams by Stack 时间限制(普通/Java):1000MS/10000MS     运行内存限制:65536KByte 描述 How can anagrams resul...
  • u011686226
  • u011686226
  • 2013年08月22日 23:31
  • 1226

Anagrams by Stack

How can anagrams result from sequences of stack operations? There are two sequences of stack operato...
  • ych19871020
  • ych19871020
  • 2013年11月06日 21:15
  • 241

leetcode:Group Anagrams 【Java】

一、问题描述 Given an array of strings, group anagrams together. For example, given: ["eat", "tea"...
  • tterminator
  • tterminator
  • 2016年03月11日 14:51
  • 1306

Leetcode: Anagrams

Given an array of strings, return all groups of strings that are anagrams. Note: All inputs will be...
  • doc_sgl
  • doc_sgl
  • 2013年10月05日 17:02
  • 6930

2016蓝桥杯算法训练——Anagrams问题

算法训练   Anagrams问题 问题描述   Anagrams指的是具有如下特性的两个单词:在这两个单词当中,每一个英文字母(不区分大小写)所出现的次数都是相同的。例如,“Uncl...
  • qq_21385857
  • qq_21385857
  • 2016年03月16日 20:01
  • 1192
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:Anagrams by Stack
举报原因:
原因补充:

(最多只允许输入30个字)