96. Unique Binary Search Trees

public class Solution {
    public int numTrees(int n) {
        int[] dp=new int[n+1];
        dp[0]=1;
        dp[1]=1;
        for(int i=2;i<=n;i++)
            for(int j=1;j<=i;j++)
                dp[i]+=dp[j-1]*dp[i-j];
        return dp[n];
    }
}

  

posted @ 2017-09-29 02:30  Weiyu Wang  阅读(125)  评论(0编辑  收藏  举报