leetcode 606. Construct String from Binary Tree 前序遍历 + 深度优先遍历DFS
来源:互联网 发布:淘宝怎么卖演唱会门票 编辑:程序博客网 时间:2024/05/16 04:00
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.
本题题意很简单,就是遍历二叉树来添加括号,直接前序遍历即可
代码如下:
#include <iostream>#include <vector>#include <map>#include <set>#include <queue>#include <stack>#include <string>#include <climits>#include <algorithm>#include <sstream>#include <functional>#include <bitset>#include <numeric>#include <cmath>#include <regex>using namespace std;/*struct TreeNode{ int val; TreeNode *left; TreeNode *right; TreeNode(int x) : val(x), left(NULL), right(NULL) {}};*/class Solution{public: string tree2str(TreeNode* t) { if (t == NULL) return ""; else { string res = to_string(t->val); string left = tree2str(t->left), right = tree2str(t->right); if (left == "" && right == "") return res; if (left == "") return res + "()" + "(" + right + ")"; if (right == "") return res + "(" + left + ")"; return res + "(" + left + ")" + "(" + right + ")"; } }};
- leetcode 606. Construct String from Binary Tree 前序遍历 + 深度优先遍历DFS
- leetcode 257. Binary Tree Paths 深度优先遍历DFS
- leetcode 655. Print Binary Tree 深度优先遍历DFS
- LeetCode 606.[DFS] Construct String from Binary Tree
- [leetcode]606. Construct String from Binary Tree
- [leetcode]: 606. Construct String from Binary Tree
- [LeetCode] 606. Construct String from Binary Tree
- Leetcode 606. Construct String from Binary Tree
- LeetCode: 606. Construct String from Binary Tree
- [LeetCode]606. Construct String from Binary Tree
- leetcode 606. Construct String from Binary Tree
- LeetCode 606. Construct String from Binary Tree
- leetcode: 606. Construct String from Binary Tree
- Leetcode-606. Construct String from Binary Tree
- leetcode-606. Construct String from Binary Tree
- leetcode-606. Construct String from Binary Tree
- LeetCode105--Tree--Construct Binary Tree from Preorder and Inorder Traversal--根据前序遍历+中序遍历构建树
- leetCode 105.Construct Binary Tree from Preorder and Inorder Traversal (根据前序遍历和中序遍历构造二叉树)
- IDEA的常用快捷键
- go连接mysql数据库
- centos 7 tomcat 8安装
- UGUI 降低填充率技巧两则
- 【福利】MySQL vs Postgre SQL: 5个你最关注的非技术维度的区别
- leetcode 606. Construct String from Binary Tree 前序遍历 + 深度优先遍历DFS
- Timer定时器的基本使用
- cocos2d-js的(layer)生命周期,ctor,onEnter,onExit的使用
- window.onload与$(document).ready()对比
- C#根据当前时间获取,本周,本月,本季度等时间段
- csdn 搜索自己的博客
- webpack安装使用教程
- PHP integer 整型
- js如何修改title值