8000
We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
2 parents 1257dda + 73434f1 commit eafa918Copy full SHA for eafa918
C++/chapTree.tex
@@ -1347,7 +1347,7 @@ \subsubsection{代码}
1347
1348
\begin{Code}
1349
// LeetCode, Unique Binary Search Trees
1350
-// 时间复杂度O(n),空间复杂度O(n)
+// 时间复杂度O(n^2),空间复杂度O(n)
1351
class Solution {
1352
public:
1353
int numTrees(int n) {
0 commit comments