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

    1. Question:

    606. Construct String from Binary Tree

    url : https://leetcode.com/problems/construct-string-from-binary-tree/description/

    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.

    2. Solution
    # 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 __init__(self):
            self.re_str = ""
    
        def preOderHelp(self, root):
            if root is None:
                return
    
            self.re_str += str(root.val)
    
            if root.left is None and root.right is None:
                return
    
            self.re_str += "("
            self.preOderHelp(root.left)
            self.re_str += ")"
    
            if root.right is None:
                return
    
            self.re_str += "("
            self.preOderHelp(root.right)
            self.re_str += ")"
    
        def tree2str(self, t):
            """
            :type t: TreeNode
            :rtype: str
            """
            if t is None:
                return ""
            self.preOderHelp(t)
            return self.re_str
  • 相关阅读:
    GOOGLE's Olympics Symbols
    写在九月的第一篇
    有点沉重的topic:出国,考研,工作?
    放弃的选择
    面临选择
    中秋节快乐!
    我该做一些改变
    使用Docker搭建一个WordPress博客
    三层架构小示例
    SQL联合查询
  • 原文地址:https://www.cnblogs.com/ordili/p/9975080.html
Copyright © 2011-2022 走看看