题目
给定两个整数数组 inorder
和 postorder
,其中 inorder
是二叉树的中序遍历, postorder
是同一棵树的后序遍历,请你构造并返回这颗 二叉树 。
示例 1:
输入:inorder = [9,3,15,20,7], postorder = [9,15,7,20,3]
输出:[3,9,20,null,null,15,7]
示例 2:
输入:inorder = [-1], postorder = [-1]
输出:[-1]
提示:
1 <= inorder.length <= 3000
postorder.length == inorder.length
-3000 <= inorder[i], postorder[i] <= 3000
inorder
和postorder
都由 不同 的值组成postorder
中每一个值都在inorder
中inorder
保证是树的中序遍历postorder
保证是树的后序遍历
代码
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
TreeNode* traversal(vector<int>& inorder, vector<int>& postorder) {
//没有后序序列
if (postorder.size() == 0) return NULL;
//只有一个结点
TreeNode* root = new TreeNode(postorder[postorder.size() - 1]);
if (postorder.size() == 1) return root;
int delimiterIndex = 0;
for (int i = 0; i < inorder.size(); i++) {
if (inorder[i] == postorder[postorder.size() - 1]) {
delimiterIndex = i;
break;
}
}
//中序序列分割
vector<int> inorderLeft(inorder.begin(), inorder.begin() + delimiterIndex);
vector<int> inorderRight(inorder.begin() + delimiterIndex + 1, inorder.end());
// postorder 舍弃末尾元素
postorder.resize(postorder.size() - 1);
//后序序列分割
vector<int> postorderLeft(postorder.begin(), postorder.begin() + inorderLeft.size());
vector<int> postorderRight(postorder.begin() + postorderLeft.size(), postorder.end());
root->left = traversal(inorderLeft, postorderLeft);
root->right = traversal(inorderRight, postorderRight);
return root;
}
TreeNode* buildTree(vector<int>& inorder, vector<int>& postorder) {
if (inorder.size() == 0 && postorder.size() == 0) return NULL;
return traversal(inorder, postorder);
}
};