python写算法题：leetcode: 95. Unique Binary Search Trees II

最新推荐文章于 2023-02-25 22:41:55 发布

激荡数十年

最新推荐文章于 2023-02-25 22:41:55 发布

阅读量169

点赞数

分类专栏：算法 python

本文链接：https://blog.csdn.net/lzf_china/article/details/98479263

版权

算法同时被 2 个专栏收录

158 篇文章 0 订阅

订阅专栏

python

115 篇文章 0 订阅

订阅专栏

class Solution(object):
    def _gen(self, cache, start, end):
        if start>end:
            return [None,]
        if (start,end) in cache:
            return cache[start,end]
        ret=[]
        for i in xrange(start, end+1):
            leftNodes=self._gen(cache, start, i-1)
            cache[(start, i-1)] = leftNodes
            rightNodes=self._gen(cache, i+1, end)
            cache[(i+1, end)] = rightNodes
            for leftn in leftNodes:
                for rightn in rightNodes:
                    node = TreeNode(i)
                    node.left=leftn
                    node.right=rightn
                    ret.append(node)
        cache[(start, end)] = ret
        return ret
    def generateTrees(self, n):
        """
        :type n: int
        :rtype: List[TreeNode]
        """
        if n==0:
            return []
        cache={}
        return self._gen(cache, 1, n)