g0001_0100.s0096_unique_binary_search_trees.solution.go Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-all Show documentation

104 LeetCode algorithm problem solutions

The newest version!

package s0096_unique_binary_search_trees

// #Medium #Top_100_Liked_Questions #Dynamic_Programming #Math #Tree #Binary_Tree
// #Binary_Search_Tree #Dynamic_Programming_I_Day_11 #Big_O_Time_O(n)_Space_O(1)
// #2024_03_15_Time_0_ms_(100.00%)_Space_2.1_MB_(46.95%)

func numTrees(n int) int {
	result := 1
	for i := 0; i < n; i++ {
		result *= 2*n - i
		result /= i + 1
	}
	result /= n + 1
	return result
}