96. Unique Binary Search Trees

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

你可能感兴趣的:(96. Unique Binary Search Trees)