本文主要是介绍96. Unique Binary Search Trees(Leetcode每日一题-2020.07.15),希望对大家解决编程问题提供一定的参考价值,需要的开发者们随着小编来一起学习吧!
Problem
Given n, how many structurally unique BST’s (binary search trees) that store values 1 … n?
Example
Solution
class Solution {
public:int numTrees(int n) {vector<int> dp(n+1,0);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];}
};
这篇关于96. Unique Binary Search Trees(Leetcode每日一题-2020.07.15)的文章就介绍到这儿,希望我们推荐的文章对编程师们有所帮助!