O(n) -> O(n^2)

Wenchao Ding · web-flow · commit 97fb733dafb4 · 2017-04-11T08:53:27.000+08:00
diff --git a/Tree/UniqueBinarySearchTrees.swift b/Tree/UniqueBinarySearchTrees.swift
@@ -2,7 +2,7 @@
  * Question Link: https://leetcode.com/problems/unique-binary-search-trees/
  * Primary idea: Dynamic programming, for each node as root, dp[i] += dp[j] * dp[i - j - 1]
  *
- * Time Complexity: O(n), Space Complexity: O(n)
+ * Time Complexity: O(n^2), Space Complexity: O(n)
  *
  * Definition for a binary tree node.
  * public class TreeNode {
@@ -34,4 +34,4 @@ class UniqueBinarySearchTrees {
         
         return dp[n]
     }
-}
+}

Original file line number	Diff line number	Diff line change
`@@ -2,7 +2,7 @@`
`2`	`2`	`* Question Link: https://leetcode.com/problems/unique-binary-search-trees/`
`3`	`3`	`* Primary idea: Dynamic programming, for each node as root, dp[i] += dp[j] * dp[i - j - 1]`
`4`	`4`	`*`
`5`		`- * Time Complexity: O(n), Space Complexity: O(n)`
	`5`	`+ * Time Complexity: O(n^2), Space Complexity: O(n)`
`6`	`6`	`*`
`7`	`7`	`* Definition for a binary tree node.`
`8`	`8`	`* public class TreeNode {`
`@@ -34,4 +34,4 @@ class UniqueBinarySearchTrees {`
`34`	`34`
`35`	`35`	`return dp[n]`
`36`	`36`	`}`
`37`		`-}`
	`37`	`+}`