Backups/CS-Notes
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Update the algorithm for 二叉搜索树的后序遍历序列

Browse Source
This commit is contained in:
Stanton
2018-07-05 15:46:43 -07:00
committed by GitHub
parent d51971aa50
commit 633aada3fe
1 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
notes/剑指 offer 题解.md
View File

@ -1532,10 +1532,10 @@ private boolean verify(int[] sequence, int first, int last)
return true; return true;
int rootVal = sequence[last]; int rootVal = sequence[last];
int cutIndex = first; int cutIndex = first;
while (cutIndex < last && sequence[cutIndex] <= rootVal) while (cutIndex < last && sequence[cutIndex] > rootVal)
cutIndex++; cutIndex++;
for (int i = cutIndex + 1; i < last; i++) for (int i = cutIndex + 1; i < last; i++)
if (sequence[i] < rootVal) if (sequence[i] > rootVal)
return false; return false;
return verify(sequence, first, cutIndex - 1) && verify(sequence, cutIndex, last - 1); return verify(sequence, first, cutIndex - 1) && verify(sequence, cutIndex, last - 1);
} }