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

    question:

    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.
    

    分析:

    先根遍历

    try:

    /**
     * Definition for a binary tree node.
     * public class TreeNode {
     *     int val;
     *     TreeNode left;
     *     TreeNode right;
     *     TreeNode(int x) { val = x; }
     * }
     */
    class Solution {
        public String tree2str(TreeNode t) {
            StringBuilder sb = new StringBuilder();
            pre_orderVisit(t,sb);
            return sb.toString();
        }
        
        public void pre_orderVisit(TreeNode t,StringBuilder sb){
            if(t==null){
                return;
            }
            sb.append(t.val);
            if(t.left==null&&t.right==null){
                return;
            }
            sb.append("(");
            pre_orderVisit(t.left,sb);
            sb.append(")");
            if(t.right!=null){
                sb.append("(");
                pre_orderVisit(t.right,sb);
                sb.append(")");
            }
            
        }
        
    }

    result:

    conclusion:

  • 相关阅读:
    透视投影矩阵的推导
    选择排序
    递归运动函数的实现
    插入排序
    基本光照模型
    顶点法向量从物体坐标系变换到世界坐标系
    Phong和BlinnPhong光照模型
    unity3d使用脚本保存屏幕截图
    【转】C++11常用特性的使用经验总结
    右手坐标系下LookAt视图矩阵的推导
  • 原文地址:https://www.cnblogs.com/hzg1981/p/8970387.html
Copyright © 2011-2022 走看看