LeetCode: 606. Construct String from Binary Tree
来源:互联网 发布:java中嵌套if 编辑:程序博客网 时间:2024/05/21 11:19
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 / 4Output: “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
\
4Output: “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.
自己的答案,执行的时间是31ms:
/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */public class Solution { public String tree2str(TreeNode t) { if (t == null) { return ""; } String result = String.valueOf(t.val); String left = tree2str(t.left); String right = tree2str(t.right); if (!left.isEmpty() && !right.isEmpty()) { result += "(" + left + ")(" + right + ")"; } else if (!left.isEmpty()) { result += "(" + left + ")"; } else if (!right.isEmpty()) { result += "()(" + right + ")"; } return result; }}
速度最快的答案,执行时间是13ms:
/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */public class Solution { public String tree2str(TreeNode t) { StringBuilder sb = new StringBuilder(); dfs(t, sb); return sb.toString(); } private void dfs(TreeNode cur, StringBuilder sb) { if (cur == null) { return; } sb.append(cur.val); if (cur.left != null) { sb.append('('); dfs(cur.left, sb); sb.append(')'); } if (cur.right != null) { if (cur.left == null) { sb.append("()"); } sb.append('('); dfs(cur.right, sb); sb.append(')'); } }}
Solution
- [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
- Leetcode-536. Construct Binary Tree from String
- LeetCode 606 Construct String from Binary Tree
- LeetCode 606 Construct String from Binary Tree
- LeetCode Construct String from Binary Tree
- leetcode 606 Construct String from Binary Tree
- Construct String from Binary Tree(leetcode)
- 面向对象--绑定方法与非绑定方法
- spring mvc 启动过程
- 一个女孩子四年同居后还剩下什么
- Unity3D编辑器之自定义窗口显示文件夹结构
- 项目管理工具禅道使用教程(简介,说明,邮箱设置)
- LeetCode: 606. Construct String from Binary Tree
- java junit
- 生产者消费者看线程同步
- nginx
- 基金加码量化策略 ——“量化+创新”很有看点
- 在 2016 年学 JavaScript 是一种什么样的体验?(转)
- BZOJ 1016: [JSOI2008]最小生成树计数 kruskal dfs
- 查询端口号占用
- JS绑定单选复选(模板替换可用)