标签:null ini ons bin struct sub bre == ++
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ class Solution { public: TreeNode* build(vector<int> v1,int s1,int e1,vector<int> v2,int s2,int e2) { if(s1 >= e1 || s2 >= e2) return NULL; int k; for(k = s2;k < e2;k++) { if(v2[k] == v1[s1]) { break; } } TreeNode* root = new TreeNode(v1[s1]); root->left = build(v1,s1+1,s1 + k - s2 + 1,v2,s2,k+1); root->right = build(v1,s1 + k - s2 + 1,e1,v2,k+1,e2); return root; } TreeNode* reConstructBinaryTree(vector<int> pre,vector<int> vin) { return build(pre,0,pre.size(),vin,0,vin.size()); } };
标签:null ini ons bin struct sub bre == ++
原文地址:https://www.cnblogs.com/Jawen/p/10960525.html