原题:
Given n, generate all structurally unique BST's (binary search trees) that store values 1...n.
For example,
Given n = 3, your program should return all 5 unique BST's shown below.
1 3 3 2 1 \ / / / \ \ 3 2 1 1 3 2 / / \ \ 2 1 2 3
思路:依然是动态规划的思想,不过每次返回的需要是一个区间的数字的树,返回值还是一个vector需要注意这一点。
代码:
/**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* {}
* };
*/
class Solution {
public:
vector<TreeNode *> generateTrees(int n) {
return genT(0,n-1);
}
vector<TreeNode *> genT(int begin, int end){
vector<TreeNode *> res;
if(begin>end){
res.push_back(NULL);
return res;
}
for (int i = begin; i<=end; i++){
vector<TreeNode *> left=genT(begin, i-1);
vector<TreeNode *> right=genT(i+1, end);
for(int j = 0; j<left.size(); j++){
for(int k = 0; k<right.size(); k++){
TreeNode *root = new TreeNode(i+1);
root->left = left[j];
root->right = right[k];
res.push_back(root);
}
}
}
return res;
}
};