前言
复习完数据结构部分的主干知识,也忙完了pygame的project,是时候开搞算法题了!希望在多刷一些题目之后能总结一些经验出来。
手绘思路
代码
Talk is cheap, show me the code!
/**
* 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* buildTree(vector<int>& inorder, vector<int>& postorder) {
// 0. 如果inorder或postorder是空的,那就说明是空咯,直接返回NULL
if(postorder.size()==0 || inorder.size()==0)
return NULL;
// 1. 找root
TreeNode* root = new TreeNode(postorder.at(postorder.size()-1));
vector<int>::iterator loc = find(inorder.begin(), inorder.end(), root->val);
if(loc == inorder.end()) return root;
// 2. 复原左子树和右子树
vector<int> left(inorder.begin(), loc);
vector<int> right(loc+1,inorder.end());
postorder.pop_back();
// 2.1. 注意这里的顺序,因为是后序遍历找root,所以要先遍历右再遍历左
root->right = buildTree(right, postorder);
root->left = buildTree(left, postorder);
return root;
}
};