publicclassSolution{publicbooleansolve(int[] sequence,int i,int j){int k = i;if(j <= i)returntrue;//找到当前序列的右子树起始数组下标for(; k <= j -1; k++){if(sequence[k]> sequence[j]){break;}}//判断左子树序列是否满足要求for(int l = k -1; l >= i; l--){if(sequence[l]> sequence[j]){returnfalse;}}//判断右子树序列是否满足要求for(int l = k; l <= j; l++){if(sequence[l]< sequence[j]){returnfalse;}}returnsolve(sequence, i, k -1)&&solve(sequence, k +1, j);}publicbooleanVerifySquenceOfBST(int[] sequence){if(sequence.length ==0){returnfalse;}returnsolve(sequence,0, sequence.length -1);}}