-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathquestion33.cpp
More file actions
40 lines (37 loc) · 1013 Bytes
/
Copy pathquestion33.cpp
File metadata and controls
40 lines (37 loc) · 1013 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
/*
输入一个整数数组，判断该数组是不是某二叉搜索树的后序遍历的结果。
如果是则输出Yes,否则输出No。假设输入的数组的任意两个数字都互不相同。
Xiaobin Tian;
*/
#include<vector>
using namespace::std;
class Solution {
bool VerifySquence(vector<int> sequence, int begin, int end, int root){
if(begin >= end){
return true;
}
int begin1 = begin;
while(sequence[begin] < sequence[root] && begin <=end){
++begin;
}
if(begin > end)
return true;
int begin2 = begin;
while(begin <=end){
if(sequence[begin] < sequence[root]){
return false;
}
++begin;
}
return VerifySquence(sequence, begin1, begin2-2, begin2-1) && VerifySquence(sequence, begin2, begin-2, begin-1);
}
public:
bool VerifySquenceOfBST(vector<int> sequence) {
if(sequence.size() == 0)
return false;
if(sequence.size() == 1)
return true;
return VerifySquence(sequence, 0, sequence.size()-2, sequence.size()-1);
}
};