zoukankan      html  css  js  c++  java
  • leetcode 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 the input and the output.
    解法1:
    dfs递归
    # Definition for a binary tree node.
    # class TreeNode(object):
    #     def __init__(self, x):
    #         self.val = x
    #         self.left = None
    #         self.right = None
    
    class Solution(object):
        def tree2str(self, t):
            """
            :type t: TreeNode
            :rtype: str
            """
            """
    Input: Binary tree: [1,2,3,4]
           1
         /   
        2     3
       /    
      4     
    Output: "1(2(4))(3)"
    1 + (root.left) + 
    (root.right) if root.right is not empty else ""
    
    Input: Binary tree: [1,2,3,null,4]
           1
         /   
        2     3
           
          4 
    Output: "1(2()(4))(3)"
    
    1 => 1
    
    2
     
      3 => 2()(3)
      
      2
     /
    3  => 2(3)
            """
            if not t: return ""
            left_s = self.tree2str(t.left)
            right_s = self.tree2str(t.right)
            if left_s:
                return str(t.val) + "(" + left_s + ")" + ("(" + right_s + ")" if right_s else "")
            else:
                return str(t.val) + ("()" + "(" + right_s + ")" if right_s else "")        

    迭代解法?写不出来。。。太特马复杂了。





  • 相关阅读:
    C语言字符编码处理
    Linux gperf命令
    C语言命令行处理
    深入分析Java ClassLoader原理
    微软Build2016:Xamarin杂记
    Ubuntu下配置Tomcat以指定(非root)身份执行
    Android之弹出多级菜单
    OC基础:Date
    Linux IO 多路复用是什么意思?
    c语言实现输出一个数的每一位
  • 原文地址:https://www.cnblogs.com/bonelee/p/8613110.html
Copyright © 2011-2022 走看看