/**
* 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:
vector<TreeNode*> generateTrees(int n) {
if(n==0) return {};
return dfs(1,n);
}
vector<TreeNode *> dfs(int start,int end){
if (start>end) return {nullptr};
vector<TreeNode*>res;
for(int i=start;i<=end;i++){
auto left=dfs(start,i-1),right=dfs(i+1,end);
for(auto a:left){
for(auto b:right){
TreeNode* node =new TreeNode(i);
node->left=a;
node->right=b;
res.push_back(node);
}
}
}
return res;
}
};
95. 不同的二叉搜索树 II( DFS经典)
最新推荐文章于 2020-07-21 21:38:45 发布