zoukankan      html  css  js  c++  java
  • 606. Construct String from Binary Tree



    You need to construct a string consists of parenthesis and integers from a binary tree with the preorder traversing way.

    The null node needs to be represented by empty parenthesis pair "()". And you need to omit all the empty parenthesis pairs that don't affect the one-to-one mapping relationship between the string and the original binary tree.

    Example 1:

    Input: Binary tree: [1,2,3,4]
           1
         /   
        2     3
       /    
      4     
    
    Output: "1(2(4))(3)"
    
    Explanation: Originallay it needs to be "1(2(4)())(3()())",
    but you need to omit all the unnecessary empty parenthesis pairs.
    And it will be "1(2(4))(3)".

    Example 2:

    Input: Binary tree: [1,2,3,null,4]
           1
         /   
        2     3
           
          4 
    
    Output: "1(2()(4))(3)"
    
    Explanation: Almost the same as the first example,
    except we can't omit the first parenthesis pair to break the one-to-one mapping relationship between




     1 class Solution {
     2     public String tree2str(TreeNode t) {
     3         if(t==null) return "";
     4         String result = t.val + "";
     5         
     6         String left = tree2str(t.left);
     7         String right = tree2str(t.right);
     8         
     9         if(left == ""&& right == "") return result;
    10         if(left == "") return result + "()" + "(" + right +")";
    11         if(right == "") return result + "(" + left +")";
    12         return result + "(" + left +")" + "(" + right +")";
    13         
    14     }
    15 }
  • 相关阅读:
    [JavaScript]编写一份会动的简历
    Vue.js 创建一个 CNODE 社区(1)
    hdu 2051
    hdu 2050
    hdu 2048
    赫夫曼编码
    R语言的学习(四)
    R语言的学习(三)
    R语言的学习(二)
    R语言的学习(一)
  • 原文地址:https://www.cnblogs.com/zle1992/p/7749400.html
Copyright © 2011-2022 走看看