zoj1944Tree Recovery 数据结构
来源:互联网 发布:网络牛牛赌博几率 编辑:程序博客网 时间:2024/05/22 08:05
Little Valentine liked playing with binary trees very much. Her favorite game was constructing randomly looking binary trees with capital letters in the nodes.
This is an example of one of her creations:
D
/ \
/ \
B E
/ \ \
/ \ \
A C G
/
/
F
To record her trees for future generations, she wrote down two strings for each tree: a preorder traversal (root, left subtree, right subtree) and an inorder traversal (left subtree, root, right subtree). For the tree drawn above the preorder traversal is DBACEGF and the inorder traversal is ABCDEFG.
She thought that such a pair of strings would give enough information to reconstruct the tree later (but she never tried it).
Now, years later, looking again at the strings, she realized that reconstructing the trees was indeed possible, but only because she never had used the same letter twice in the same tree.
However, doing the reconstruction by hand, soon turned out to be tedious.
So now she asks you to write a program that does the job for her!
Input
The input will contain one or more test cases.
Each test case consists of one line containing two strings preord and inord, representing the preorder traversal and inorder traversal of a binary tree. Both strings consist of unique capital letters. (Thus they are not longer than 26 characters.)
Input is terminated by end of file.
Output
For each test case, recover Valentine's binary tree and print one line containing the tree's postorder traversal (left subtree, right subtree, root).
Sample Input
DBACEGF ABCDEFG
BCAD CBAD
Sample Output
ACBFGED
CDAB
import java.io.BufferedInputStream;import java.io.PrintWriter;import java.util.Scanner;public class Main {public static void main(String[] args) {new Task().solve();}}class Task {Scanner in = new Scanner(new BufferedInputStream(System.in)) ;PrintWriter out = new PrintWriter(System.out);void dfs(String preorder , String inorder){if(preorder == null || preorder.length() == 0){return ;}char c = preorder.charAt(0) ;int i = inorder.indexOf(c) ;preorder = preorder.substring(1) ;dfs(preorder.substring(0, i), inorder.substring(0, i));dfs(preorder.substring(i), inorder.substring(i+1));out.print(c) ;}void solve() {while(in.hasNext()){dfs(in.next(), in.next());out.println();//out.flush(); }out.flush(); }}
- zoj1944Tree Recovery 数据结构
- zoj 1944 Tree Recovery(数据结构)
- 数据结构基础+STL--tree recovery
- recovery
- recovery
- Recovery
- uva 536 - Tree Recovery 入门经典II 第六章 数据结构基础 习题6-3
- Backup & Recovery
- Disaster Recovery
- Android Recovery
- Recovery简介
- Android recovery
- Lustre Recovery
- Recovery简介
- rman recovery
- Crash Recovery
- android recovery
- recovery学习
- 拨盘Demo大赛,获奖公布-20170710
- spring boot项目,Elasticsearch的一种使用方式
- hibernate数据库方言
- 自定义弹窗跳到app商店评价进行评分
- [LeetCode]630. Course Schedule III
- zoj1944Tree Recovery 数据结构
- java 简单的聊天工具 (带界面的)
- 安装vue.js的方法
- 使用pinctrl子系统实现引脚功能动态切换
- 创建项目时 building “XXX”gradle project info的解决办法
- Java异常
- 程序之学习mongodb安装
- [题解]bzoj3600 没有人的算数
- POJ 1062 昂贵的聘礼(预处理和dijkstra算法)(M)