[LeetCode]Unique Binary Search Trees II@Python

Unique Binary Search Trees II

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]
]

Solution
虽然没有dp数组，但是cache的思想与dp是一致的，减少了重复计算

# Definition for a binary tree node.
# class TreeNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution(object):
    def generateTrees(self, n):
        """
        :type n: int
        :rtype: List[TreeNode]
        """
        if n<1:
            return []
        cache = {}
        def generate(first, last):
            if first>last:
                return [None]
            if (first, last) in cache:
                return cache[first, last]
            trees = []
            for i in range(first, last+1):
                for left in generate(first, i-1):
                    for right in generate(i+1, last):
                        node = TreeNode(i)
                        node.left = left
                        node.right = right
                        trees.append(node)
            cache[first, last] = trees
            return trees
        return generate(1, n)