zoukankan      html  css  js  c++  java
  • Poj 2255 Tree Recovery

    1.Link:

    http://poj.org/problem?id=2255

    2.Content:

    Tree Recovery
    Time Limit: 1000MS   Memory Limit: 65536K
    Total Submissions: 11448   Accepted: 7186

    Description

    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
    

    Source

    3.Method:

    4.Code:

     1 #include "stdio.h"
     2 #include "string.h"
     3 #define NUM 27
     4 char ans[NUM];
     5 int pos;
     6 void func(char a[],char b[],int al,int bl,int len)
     7 {
     8     int i;
     9     if(len==0) return;
    10     else if(len==1) ans[pos--]=a[al];
    11     else
    12     {
    13         ans[pos--]=a[al];
    14         for(i=bl;i<bl+len;i++) if(b[i]==a[al]) break;
    15         func(a,b,al+(i-bl)+1,i+1,bl+(len-1)-i);
    16         func(a,b,al+1,bl,i-bl);    
    17     }
    18 }
    19 int main()
    20 {
    21     char a[NUM],b[NUM];
    22     int len;
    23     while(scanf("%s%s",a,b) != EOF)
    24     {
    25         len=strlen(a);
    26         pos=len-1;
    27         func(a,b,0,0,len);
    28         ans[len]='';
    29         printf("%s
    ",ans);
    30     }
    31     return 0;
    32 }

    5.Reference

  • 相关阅读:
    get函数理解
    get函数理解
    Absolute C++ 第9章字符串 编程练习4
    Absolute C++ 第9章字符串 编程练习4
    Absolute C++ 第9章字符串 编程练习4
    Absolute C++ 第9章字符串 编程练习4
    C字符串使用陷阱 “=”和“==” 学习笔记
    [Android]ListView中分割线的设置
    如何在adapter 中调用activity的方法
    Android开发中Handler的经典总结
  • 原文地址:https://www.cnblogs.com/mobileliker/p/3933405.html
Copyright © 2011-2022 走看看