Unique Binary Search Trees Solutions in Python

Number 96

Difficulty Medium

Acceptance 53.0%

Other languages C++, Go

Solutions

Python solution by haoel/leetcode

def numTrees(self, n):
    if n == 1: return 1
    res = [1, 1]
    for i in range(2, n + 1):
        val = 0
        for j in range(i):
            val += res[j] * res[i - j - 1]
        res.append(val)
    return res[n]

def numTrees(self, n):
    if n == 1: return 1
    res = [1, 1]
    for i in range(2, n + 1):
        val = 0
        for j in range(i):
            val += res[j] * res[i - j - 1]
        res.append(val)
    return res[n]