1

kedebug · kedebug · commit 27b21eaec3ae · 2013-07-03T10:37:53.000+08:00
diff --git a/UniqueBinarySearchTrees/UniqueBinarySearchTrees.cpp b/UniqueBinarySearchTrees/UniqueBinarySearchTrees.cpp
@@ -0,0 +1,15 @@
+class Solution {
+public:
+    int numTrees(int n) {
+        // Start typing your C/C++ solution below
+        // DO NOT write int main() function
+        
+        vector<int> dp(n + 1, 0);
+        dp[0] = dp[1] = 1;
+        for (int i = 2; i <= n; i++) {
+            for (int j = 0; j < i; j++)
+                dp[i] += dp[j] * dp[i-j-1];
+        }
+        return dp[n];
+    }
+};
