A:输入某二叉树的前序遍历和中序遍历的结果,请重建出该二叉树。假设输入的前序遍历和中序遍历的结果中都不含重复的数字。例如输入前序遍历序列{1,2,4,7,3,5,6,8}和中序遍历序列{4,7,2,1,5,3,8,6},则重建二叉树并返回。
Q:
这是我第一次写的(结果无误但不知为何超时。。。):
public class Solution {
public TreeNode reConstructBinaryTree(int [] pre,int [] in) {
int a = 0;//记录in数组中根节点所在位置
TreeNode root = new TreeNode(pre[0]);
for(int i = 0; i < in.length; i++){
if(pre[0] == in[i]){
a = i;
break;
}
}
//判断根节点在in数组中的位置
if(a == 0) {
root.right = ConstructRightTree(pre, in, a+1, 1);
return root;
}
else if (a == pre.length-1){
root.left = ConstructLeftTree(pre, in, a-1, 1);
return root;
}
else {
root.left = ConstructLeftTree(pre, in, a-1, 1);
root.right = ConstructRightTree(pre, in, a+1, a+1);
return root;
}
}
//start为其子树的根节点在pre数组中的位置
private TreeNode ConstructLeftTree(int[] pre, int[] in, int a, int start) {
int a1 = 0;//记录in数组中子树根节点所在位置
TreeNode root = new TreeNode(pre[start]);
if(start == pre.length-1) return root;
else{
for(int i = 0; i < in.length; i++){
if(pre[start] == in[i]){
a1 = i;
break;
}
}
//判断根节点在in数组中的位置
if(a1 == 0) {
root.right = ConstructRightTree(pre, in, a1+1, start+1);
return root;
}
else if (a1 == a){
root.left = ConstructLeftTree(pre, in, a1-1, start+1);
return root;
}
else {
root.left = ConstructLeftTree(pre, in, a1-1, start+1);
root.right = ConstructRightTree(pre, in, a1+1, start+1);
return root;
}
}
}
private TreeNode ConstructRightTree(int[] pre, int[] in, int a, int start) {
int a1 = 0;
TreeNode root = new TreeNode(pre[start]);
if(start == pre.length-1) return root;
else{
for(int i = 0; i < in.length; i++){
if(pre[start] == in[i]){
a1 = i;
break;
}
}
if(a1 == a) {
root.right = ConstructRightTree(pre, in, a1+1, start+1);
return root;
}
else if (a1 == pre.length-1){
root.left = ConstructLeftTree(pre, in, a1-1, start+1);
return root;
}
else {
root.left = ConstructLeftTree(pre, in, a1-1, start+1);
root.right = ConstructRightTree(pre, in, a1+1, start+1);
return root;
}
}
}
public static void main(String[] args) {
int[] pre = {1,2,4,7,3,5,6,8};
int[] in = {4,7,2,1,5,3,8,6};
Solution solution = new Solution();
Long startTime = System.currentTimeMillis();
TreeNode treeNode = solution.reConstructBinaryTree(pre,in);
System.out.println(treeNode.right.left.val);
Long endTime = System.currentTimeMillis();
Long tempTime = (endTime - startTime);
System.out.println("花费时间:"+
(((tempTime/86400000)>0)?((tempTime/86400000)+"d"):"")+
((((tempTime/86400000)>0)||((tempTime%86400000/3600000)>0))?((tempTime%86400000/3600000)+"h"):(""))+
((((tempTime/3600000)>0)||((tempTime%3600000/60000)>0))?((tempTime%3600000/60000)+"m"):(""))+
((((tempTime/60000)>0)||((tempTime%60000/1000)>0))?((tempTime%60000/1000)+"s"):(""))+
((tempTime%1000)+"ms"));
}
}
class TreeNode {
int val;
TreeNode left;
TreeNode right;
TreeNode(int x) { val = x; }
}
执行结果为:
5
花费时间:1ms
这是看了网上大牛后修改的,还是发现自己果然很愚…,慢慢学习:
public class Solution {
public TreeNode reConstructBinaryTree(int [] pre,int [] in) {
TreeNode root=ConstructBinaryTree(pre,0,pre.length-1,in,0,in.length-1);
return root;
}
//前序遍历{1,2,4,7,3,5,6,8}和中序遍历序列{4,7,2,1,5,3,8,6}
private TreeNode ConstructBinaryTree(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=ConstructBinaryTree(pre,startPre+1,startPre+i-startIn,in,startIn,i-1);
root.right=ConstructBinaryTree(pre,i-startIn+startPre+1,endPre,in,i+1,endIn);
break;
}
return root;
}
}