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.

    思路:

    递归先序遍历二叉树,注意区分左子树和右子树是否为空的情况。

    void pre(TreeNode* t,string& str)
    {
      if(t!=NULL)
      {
        str+=to_string(t->val);  
        if(t->left!=NULL || t->right!=NULL)
        {
          str+="(";
          pre(t->left,str);
          str+=")";
          if(t->right!=NULL)
          {
         str+="(";
          pre(t->right,str);
          str+=")";
          }      
        }    
      } 
    }
    string tree2str(TreeNode* t)
    {
      string str="";
      if(t==NULL) return str;
      pre(t,str);
      return str;
    }
  • 相关阅读:
    Mongodb C#客户端数据关联数据,使用Linq语法进行关联
    express增加swagger功能
    RabbitMQ错误检查
    nodejs mongoose populate 多层模型
    c# Mongodb
    vscode安装过的插件
    phantomjs安装步骤
    记录平时有用到的前端学习网站
    初学做uniapp项目过程梳理的一些记录
    用纯css实现双边框效果
  • 原文地址:https://www.cnblogs.com/hellowooorld/p/6940002.html
Copyright © 2011-2022 走看看