跟上一題一樣，就注意一下算標記的時候別算錯！
/** * 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* create(vector<int>& inorder, vector<int>& postorder, int is, int ie, int ps, int pe){ if(ps > pe) return NULL; if(is > ie) return NULL; TreeNode* node = new TreeNode(postorder[pe]); int pos; for(int i = is; i <= ie; ++ i){ if(node -> val == inorder[i]){ pos = i; break; } } node -> left = create(inorder, postorder, is, pos - 1, ps, ps + pos - is - 1); node -> right = create(inorder, postorder, pos + 1, ie, ps + pos - is, pe - 1); return node; } TreeNode* buildTree(vector<int>& inorder, vector<int>& postorder) { return create(inorder, postorder, 0, inorder.size() - 1, 0, postorder.size() - 1); }新聞熱點
疑難解答
