#include <vector>
class Solution {
public:
int numTrees(int n) {
vector<int> dp(n+1);
dp[0] = dp[1] = 1;
for(int i=2;i<=n;i++)
{
dp[i] = 0;
for(int j=0;j<i;j++)
dp[i] = dp[i]+dp[j]*dp[i-j-1];//use the dynamic thought of dp
}
return dp[n];
}
};
leetcode java unique binary search tree
最新推荐文章于 2022-01-16 02:58:50 发布