class TreeNode { int val; TreeNode left; TreeNode right; TreeNode(int x) { val = x; } } public class Sol7 { public TreeNode reConstructBinaryTree(int[] pre, int[] in) { TreeNode root = reConstructBinaryTree(pre, 0, pre.length - 1, in, 0, in.length - 1); return root; } private TreeNode reConstructBinaryTree(int[] pre, int startPre, int endPre, int[] in, int startIn, int endIn) { if (startPre > endPre || startIn > endIn) return null; TreeNode root = new TreeNode(pre[startPre]); for (int i = startIn; i <= endIn; i++) if (in[i] == pre[startPre]) { root.left = reConstructBinaryTree(pre, startPre + 1, startPre + i - startIn, in, startIn, i - 1); root.right = reConstructBinaryTree(pre, startPre + i - startIn + 1, endPre, in, i + 1, endIn); break; } return root; } }
原文:https://www.cnblogs.com/Aug-20/p/11734664.html