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 "")        

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





  • 相关阅读:
    Java面试:用set集合的时候,重写过hashcode()和equal()方法吗?有什么作用?
    Bootstrap起步
    Java NIO
    Dobbo和SpringCloud区别
    Java虚拟机类加载机制和双亲委派模型
    继承和组合的特点和区别
    LinkedList和ArrayList底层原理
    聚集索引和非聚集索引
    Stream和迭代器的区别
    悲观锁和乐观锁
  • 原文地址:https://www.cnblogs.com/bonelee/p/8613110.html
Copyright © 2011-2022 走看看