解法:二叉搜素树,想法是,把每一个数当根结点,然后去划分左右子树,最开始没有想好如何去吧结果放到数组中,只关注如何区分左右子书,重写方法,还是同样的类型,用来算每个节点的可能性,每个点都可能,然后保留当前点,左右划分,分完之后,不能划分只有两种,一种只有一个,一种是null,排列组合所有左右节点可能,放到ans。
/**
* 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:
//很明显 写出所有root的可能 然后递归寻找左右孩子
vector<TreeNode*> generateTrees(int start,int end)
{
vector<TreeNode*> ans;
if (start > end)
{
ans.push_back(NULL);
return ans;
}
if (start == end)
{
TreeNode *x = new TreeNode(end);
ans.push_back(x);
return ans;
}
for (int i = start; i <= end; i++)
{
vector<TreeNode*> left = generateTrees(start,i-1);//左字数
vector<TreeNode*> right = generateTrees(i+1, end);//右子书
for (int l = 0; l < left.size(); l++)
{
for (int r = 0; r < right.size(); r++)
{
TreeNode *root = new TreeNode(i);
root->left = left[l];
root->right = right[r];
ans.push_back(root);
}
}
}
return ans;
}
vector<TreeNode*> generateTrees(int n) {
vector<TreeNode*> ans;
if(n==0)
{
return ans;
}
return generateTrees(1, n);
}
};
Given an integer 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