分析:该问题是经典问题,混乱点在于运用递归解题时如何去维护变量和边界,这也是编程的难点。
1、边界无效的判定
2、利用前序左边界初始化根结点
3、利用循环找到中序遍历数组中根结点的索引
4、计算中序遍历数组中是左子树的元素个数
5、递归(注意维护边界条件)
6、返回根结点
class Solution{
public:
TreeNode* buildTree(vector<int>& preorder, vector<int>& inorder){
return pre_order(0, preorder.size() - 1, 0, inorder.size() - 1, preorder, inorder);
}
TreeNode *pre_order(int leftpre, int rightpre, int leftin, int rightin, vector<int> &pre, vector<int> &in){
if(leftpre > rightpre || leftin > rightin)
return nullptr;
TreeNode* root = new TreeNode(pre[leftpre]);
int rootin = leftin;
while(rootin <= rightin && in[rootin] != pre[leftpre])
rootin ++;
int left = rootin - leftin;
root->left = pre_order(leftpre + 1, leftpre + left, leftin, rootin - 1, pre, in);
root->right = pre_order(leftpre + left + 1, rightpre, rootin + 1, rightin, pre, in);
return root;
}
};