We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 5f15637 commit 678f159Copy full SHA for 678f159
C++/chapTree.tex
@@ -1442,12 +1442,13 @@ \subsubsection{描述}
1442
1443
1444
\subsubsection{分析}
1445
-
+检查中序遍历得到的数列是否是递增数列。注意comparator的使用。
1446
1447
\subsubsection{代码}
1448
1449
\begin{Code}
1450
// LeetCode, Validate Binary Search Tree
1451
+// @author Michael Liu (http://lxieyang.github.io)
1452
// 时间复杂度O(n),空间复杂度O(\logn)
1453
class Solution {
1454
public:
0 commit comments