题目
思路
- 记录其前序遍历和中序遍历和长度 构建二叉树
- 难点在于构建,应该是需要递归构建,之前自己写出来过,现在好像完全不会写了…
- 整了半天发现我是忽视了负数和多位数的情况…吐血
代码
StringBuilder ans = new StringBuilder();
int length=0;
public String serialize(TreeNode root) {
pre(root);
ans.insert(0,length);
ans.insert(1," ");
order(root);
return ans.toString();
}
public void pre(TreeNode root){
if(root==null) return;
ans.append(root.val+" ");
length++;
if(root.left!=null) pre(root.left);
if(root.right!=null) pre(root.right);
}
public void order(TreeNode root){
if(root==null) return;
if(root.left!=null) order(root.left);
ans.append(root.val+" ");
if(root.right!=null) order(root.right);
}
public TreeNode deserialize(String data) {
String[] arr = data.split(" ");
int length = Integer.valueOf(arr[0]);
int[] pre =new int[length];
int[] order = new int[length];
for(int i=0;i<length;i++) pre[i] = Integer.valueOf(arr[1+i]);
for(int i=0;i<length;i++) order[i] = Integer.valueOf(arr[1+i+length]);
return Resume(pre,order);
}
public TreeNode Resume(int[] pre,int[] order){
if(order.length==0) return null;
TreeNode root = new TreeNode(pre[0]);
int local=0;
while (order[local] !=root.val) local++;
int[] left_pre = Arrays.copyOfRange(pre,1,pre.length);
int[] left_order = Arrays.copyOfRange(order,0,local);
int[] right_pre = Arrays.copyOfRange(pre,local+1,pre.length);
int[] right_ord = Arrays.copyOfRange(order,local+1,order.length);
root.left = Resume(left_pre,left_order);
root.right = Resume(right_pre,right_ord);
return root;
}