之前一直以为很简单,碰见的话肯定能写出来,结果今天面试竟然碰到了,写了半天硬是没写对,很是尴尬,
其实和我最后想的分别记录前序数组的前后位置,以及后序数组的左右位置是一样的,当时又感觉不太对,没敢写,
结果别面试跳过了。
代码:
/**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
TreeNode *buildTree(vector<int> &preorder, vector<int> &inorder) {
return build(preorder,inorder,0,preorder.size()-1,0,inorder.size()-1);
}
TreeNode *build(vector<int> &preorder,vector<int> &inorder,int l1,int r1,int l2,int r2){
if(l1>r1)
return NULL;
int val=preorder[l1];
int index,cnt=0;
for(index=l2;index<=r2&&inorder[index]!=val;index++,cnt++);
TreeNode *tem=new TreeNode(val);
tem->left=build(preorder,inorder,l1+1,l1+cnt,l2,index-1);
tem->right=build(preorder,inorder,l1+cnt+1,r1,index+1,r2);
return tem;
}
};