LeetCode刷题【Array】 Construct Binary Tree from Inorder and Postorder Traversal
来源:互联网 发布:知乎 矢仓枫子 编辑:程序博客网 时间:2024/06/06 04:54
Given inorder and postorder traversal of a tree, construct the binary tree.
Note:
You may assume that duplicates do not exist in the tree.
解决方法一:Runtime: 22 ms
/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */public class Solution { public TreeNode buildTree(int[] inorder, int[] postorder) { return tree(inorder,0,inorder.length-1,postorder,postorder.length-1); } private TreeNode tree(int[] inorder,int left,int right, int[] postorder, int index){ if(index<0||left>right) return null; if(left==right){ TreeNode node = new TreeNode(inorder[left]); node.left=null; node.right=null; return node; } for(int i=index;i>=0;i--){ for(int j=left;j<=right;j++){ if(inorder[j]==postorder[i]){ TreeNode node = new TreeNode(postorder[i]); node.left=tree(inorder,left,j-1,postorder,index-1); node.right=tree(inorder,j+1,right,postorder,index-1); return node; } } } return null; }}
参考:
【1】https://leetcode.com/
0 0
- LeetCode刷题【Array】 Construct Binary Tree from Inorder and Postorder Traversal
- *(leetcode) Construct Binary Tree from Inorder and Postorder Traversal (tree)
- LeetCode[Tree]: Construct Binary Tree from Inorder and Postorder Traversal
- LeetCode: Construct Binary Tree from Inorder and Postorder Traversal
- [LeetCode]Construct Binary Tree from Inorder and Postorder Traversal
- LeetCode Construct Binary Tree from Inorder and Postorder Traversal
- LeetCode: Construct Binary Tree from Inorder and Postorder Traversal
- LeetCode: Construct Binary Tree from Inorder and Postorder Traversal
- [LeetCode] Construct Binary Tree from Inorder and Postorder Traversal
- LeetCode Construct Binary Tree from Inorder and Postorder Traversal
- [Leetcode] Construct Binary Tree from Inorder and Postorder Traversal
- leetcode 110: Construct Binary Tree from Inorder and Postorder Traversal
- 【leetcode】Construct Binary Tree from Inorder and Postorder Traversal
- [LeetCode]Construct Binary Tree from Inorder and Postorder Traversal
- [leetcode]Construct Binary Tree from Inorder and Postorder Traversal
- LeetCode-Construct Binary Tree from Inorder and Postorder Traversal
- [leetcode] Construct Binary Tree from Inorder and Postorder Traversal
- LeetCode - Construct Binary Tree from Inorder and Postorder Traversal
- node(npm)配置vue时出现 vue不是内部或外部命令!!!!!!
- 机器学习常见的六大错误
- java中子类继承父类时是否继承构造函数呢?
- 数据结构---顺序表
- ubuntu 安装 pip 及 pip 常用命令
- LeetCode刷题【Array】 Construct Binary Tree from Inorder and Postorder Traversal
- Java 设计模式 之 状态模式(State)
- uc/os-ii 实验6:消息邮箱(2)
- 将博客搬至CSDN
- java序列化
- jxls操作excel
- C语言 strsep函数实现
- DecimalFormat用法
- 《合成孔径雷达成像——算法与实现》之【16】仿真图7.5