【LeetCode】106.Construct Binary Tree from Inorder and Postorder Traversal(Medium)解题报告

【LeetCode】106.Construct Binary Tree from Inorder and Postorder Traversal(Medium)解题报告

题目地址：https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/description/
题目描述：

  Given inorder and postorder traversal of a tree, construct the binary tree.

  Note:You may assume that duplicates do not exist in the tree.

For example, given

inorder = [9,3,15,20,7]
postorder = [9,15,7,20,3]
Return the following binary tree:

    3
   / \
  9  20
    /  \
   15   7

Solutions:

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public TreeNode buildTree(int[] inorder, int[] postorder) {
        if (inorder == null || postorder == null || inorder.length != postorder.length) return null;
        // 保存中序遍历根节点索引
        HashMap<Integer, Integer> map = new HashMap<>();
        for (int i = 0; i < inorder.length; i++) map.put(inorder[i], i);
        return helper(0, inorder.length - 1, 0, postorder.length - 1, inorder, postorder, map);
    }
     private TreeNode helper(int inStart, int inEnd, int postStart, int postEnd, int[] inorder, int[] postorder, Map<Integer, Integer> map) {
        if (postStart > postEnd || inStart > inEnd) return null;
        // postorder的最后一个元素一定是二叉树的根节点
        TreeNode root = new TreeNode(postorder[postEnd]);
        int inRoot = map.get(postorder[postEnd]);
        root.left = helper(inStart, inRoot - 1, postStart, postStart + (inRoot - inStart - 1), inorder, postorder, map);
        root.right = helper(inRoot + 1, inEnd, postStart + (inRoot - inStart), postEnd - 1, inorder, postorder, map);
        return root;
    }
}

Date：2018年5月1日