企业官网建设流程全解析

沈阳网站维护,公司网站建设哪个最好,下面哪些是用作电子商务网站开发,烟台网站排名106. 从中序与后序遍历序列构造二叉树 106. 从中序与后序遍历序列构造二叉树 我感觉我的数据结构都要忘光光了 题目#xff1a; 题解#xff1a; /*** Definition for a binary tree node.* public class TreeNode {* int val;* TreeNode left;* TreeNode ri…106. 从中序与后序遍历序列构造二叉树106. 从中序与后序遍历序列构造二叉树我感觉我的数据结构都要忘光光了题目题解/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode() {} * TreeNode(int val) { this.val val; } * TreeNode(int val, TreeNode left, TreeNode right) { * this.val val; * this.left left; * this.right right; * } * } */ class Solution { public MapInteger,Integer map new HashMap(); public int[] postorder; public TreeNode buildTree(int[] inorder, int[] postorder) { for(int i0;iinorder.length;i) { map.put(inorder[i], i); } this.postorder postorder; return recur(0,inorder.length-1,0,postorder.length-1); } public TreeNode recur(int left, int right, int l,int r) { if(left right || l r) { return null; } int root postorder[r]; int i map.get(root); TreeNode node new TreeNode(root); node.left recur(left, i-1, l, li-1-left); node.right recur(i1, right, li-left, r-1); return node; } }