Skip to content

Conversation

x1957
Copy link
Contributor

@x1957 x1957 commented Jan 14, 2014

Unique Binary SearchTrees 时间复杂度O(n^2)

for (int i = 2; i <= n; ++i) { for (int k = 1; k <= i; ++k) f[i] += f[k-1] \* f[i - k]; }

Unique Binary SearchTrees 时间复杂度O(n^2)
soulmachine added a commit that referenced this pull request Jan 16, 2014
@soulmachine soulmachine merged commit eafa918 into soulmachine:master Jan 16, 2014
@soulmachine
Copy link
Owner

Good job!

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants