《剑指offer—面试题33:二叉搜索树的后序遍历序列》
注明:仅个人学习笔记
Java - 数组拷贝的几种方式:
https://blog.csdn.net/u011669700/article/details/79323251
import java.util.Arrays;
/**
*
*
* 二叉搜索树的后序遍历序列 输入一个整型数组,
* 判断该数组是不是某二叉搜索树的后序遍历结果
*
*/
public class VerifySquenceOfBST33
{
public boolean VerifySquenceOfBST(int[] sequence)
{
int length = sequence.length;
if (length <= 0 || sequence == null)
{
return false;
}
int root = sequence[length - 1];
// 在二叉搜索树中,左子树的值均小于root
int i = 0;
for (; i < length - 1; ++i)
{
if (sequence[i] > root)
{
break;
}
}
// 在二叉搜索树中,右子树的值均大于root
int j = i;
for (; j < length - 1; ++j)
{
if (sequence[j] < root)
{
return false;
}
}
boolean left = true;
if (i > 0)//越界检查
{
int[] array = Arrays.copyOfRange(sequence, 0, i);// 左子树再去判断,拷贝原数组,从位置0开始,拷贝i个数
left = VerifySquenceOfBST(array);
}
boolean right = true;
if (i > 0 && j < length - 1)//越界检查
{
int[] brray = Arrays.copyOfRange(sequence, i, j);// 右子树再去判断,拷贝原数组,从位置i开始,拷贝j个数
right = VerifySquenceOfBST(brray);
}
return (left && right);
}
public static void main(String[] args)
{
VerifySquenceOfBST33 v = new VerifySquenceOfBST33();
// int[] sequence = { 5, 7, 6, 9, 11, 10, 8 };
// System.out.println(v.VerifySquenceOfBST(sequence));
// int[] sequence2 = { 7, 4, 6, 5 };
// System.out.println(v.VerifySquenceOfBST(sequence2));
int[] sequence3 = { 4, 6, 7, 5 };
System.out.println(v.VerifySquenceOfBST(sequence3));
}
}