class Solution(object): def numTrees(self, n): num = [[0] * (n + 1) for i in range(n + 1)] num[0][0] = 1 for i in range(1, n + 1): for j in range(1, n + 1): num[i][j] = sum(num[i - j]) * sum(num[j - 1]) return sum(num[n])
LeetCode 96. Unique Binary Search Trees (Python)最优解--Apolo_Shane
最新推荐文章于 2022-07-29 22:31:06 发布