标签：des style blog http io ar color os sp
| Time Limit: 1000MS | Memory Limit: 65536K | |
| Total Submissions: 11774 | Accepted: 7382 |
Description
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). Input
Output
Sample Input
DBACEGF ABCDEFG BCAD CBAD
Sample Output
ACBFGED CDAB
#include<iostream> #include<cstring> #include<cstdio> void build(int n,char *s1,char *s2,char *s) { if(n<=0) return ; int p=strchr(s2,s1[0])-s2;//找到根结点在中序遍历中的位置 build(p,s1+1,s2,s);//递归构造左子树的后序遍历 build(n-p-1,s1+p+1,s2+p+1,s+p);//递归构造右子树的后序遍历 s[n-1]=s1[0];//把根结点添加到最后 } int main() { char s1[50],s2[50],ans[50]; while(~scanf("%s%s",s1,s2)) { int n=strlen(s1); build(n,s1,s2,ans); ans[n]=‘\0‘; printf("%s\n",ans); } return 0; }
标签：des style blog http io ar color os sp
原文地址：http://www.cnblogs.com/cancangood/p/4143812.html
