题目:
根据前序遍历后序遍历构建二叉树。
示例:
输入:pre = [1,2,4,5,3,6,7], post = [4,5,2,6,7,3,1]
输出:[1,2,3,4,5,6,7]
代码实现如下:
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
TreeNode* connect(vector<int>& pre,int begin1,int end1,
vector<int>& post,int begin2,int end2){
if(begin1>end1||begin2>end2){
return nullptr;
}
//开辟新空间
TreeNode* root = new TreeNode(pre[begin1]);
root->left=root->right=nullptr;
if(begin1 == end1){
return root;
}
int nextval = pre[begin1+1];
//记录左孩子
int pidx,len;
//遍历后序遍历,找到nextval
for(int i = begin2;i<end2;i++){
if(post[i] == nextval){
pidx = i;
break;
}
}
len = pidx - begin2;//子树结点个数
//当前root有两个儿子
if(pidx!=(end2-1)){
root->left = connect(pre,begin1+1,
begin1+len+1,post,begin2,pidx);
root->right = connect(pre,begin1+len+2,
end1,post,pidx+1,end2-1);
}
//当前root只有一个儿子,为左儿子
else{
root->left = connect(pre,begin1+1,end1,post,begin2,end2-1);
}
return root;
}
TreeNode* constructFromPrePost(vector<int>& pre, vector<int>& post) {
//前序遍历 1 2 4 5 3 6 7
//后序遍历 4 5 2 6 7 3 1
//前序 root->val = 1
int len1 = pre.size();
int len2 = post.size();
return connect(pre,0,len1-1,post,0,len2-1);
}
};
请注意“==”一定不要写成‘=’,这个问题困扰了我半个小时,希望引以为戒。