Given an integer n, generate all structurally unique BST’s (binary search trees) that store values 1 … n.
Example:
Input: 3
Output:
[
[1,null,3,2],
[3,2,null,1],
[3,1,null,null,2],
[2,1,3],
[1,null,2,null,3]
]
Explanation:
The above output corresponds to the 5 unique BST's shown below:
1 3 3 2 1
\ / / / \ \
3 2 1 1 3 2
/ / \ \
2 1 2 3
思路:在1-n的二叉搜索树中中,假设i为定点,则0~ i-1在i的左侧,i+1~ n在i的右侧,以i为顶点的二叉搜索树为 左侧的二叉树为1 ~ i-1,右侧的二叉树为i+1~n的二叉树。
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
Map<String, List<TreeNode>> maps= new HashMap<>();
public List<TreeNode> generateTrees(int n) {
if(n < 1) {
return new ArrayList();
}
return trees(1, n);
}
public List<TreeNode> trees(int b,int n) {
List<TreeNode> ret= new ArrayList<>();
String s = String.valueOf(b) + "_" + String.valueOf(n);
if(maps.containsKey(s)) {
return maps.get(s);
}
if(b >n) {
ret.add(null);
maps.put(s, ret);
return ret;
}
if(b == n) {
ret.add(new TreeNode(b));
maps.put(s, ret);
return ret;
}
for(int i = b; i <= n; i++) {
List<TreeNode> left = trees(b, i - 1);
List<TreeNode> right = trees(i + 1, n);
for(int j = 0; j < left.size(); j++) {
for(int k = 0; k < right.size(); k++) {
TreeNode root = new TreeNode(i);
root.left = left.get(j);
root.right = right.get(k);
ret.add(root);
}
}
}
maps.put(s, ret);
return ret;
}
}