输入某二叉树的前序遍历和中序遍历的结果,请重建该二叉树。假设输入的前序遍历和中序遍历的结果中都不含重复的数字。
例如,给出
前序遍历 preorder = [3,9,20,15,7]
中序遍历 inorder = [9,3,15,20,7]
返回如下的二叉树:
3
/ \
9 20
/ \
15 7
限制:
0 <= 节点个数 <= 5000
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/zhong-jian-er-cha-shu-lcof
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
分析:
递归,不断将问题的规模缩小
注意C++的distance和find的用法以及新vector的构造
解答:
/**
* 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* buildTree(vector<int>& preorder, vector<int>& inorder) {
if(preorder.empty()||inorder.empty()) return NULL;
TreeNode* root = new TreeNode(preorder[0]);
int dist = distance(begin(inorder), find(inorder.begin(),inorder.end(),preorder[0]));
vector<int> in_left(inorder.begin(),inorder.begin()+dist);
vector<int> in_right(inorder.begin()+1+dist, inorder.end());
vector<int> pre_left(preorder.begin()+1,preorder.begin()+1+dist);
vector<int> pre_right(preorder.begin()+1+dist, preorder.end());
root->left = buildTree(pre_left, in_left);
root->right = buildTree(pre_right, in_right);
return root;
}
};