public static int getHigh(int [][] array,int area) {
if (area == 0) return 0;
if (area < 2) return 1;
int[][] newarray = new int[array.length+2][2];
for (int i = 0; i <array.length ; i++) {
newarray[i] = array[i];
}
newarray[array.length] = new int[]{0,0};
newarray[array.length+1] = new int[]{area,area};
int max = 0;
int x1 = 0;
int y1 = 0;
for (int i = 0; i < newarray.length-1 ; i++) {
// 获取任意两个节点的长度
for (int j = i; j < newarray.length-1 ; j++) {
x1 = Math.abs(newarray[i][0] - newarray[j+1][0]);
y1 = Math.abs(newarray[i][1] - newarray[j+1][1]);
// 判断这两个节点之间是否有其他节点,如果有则废除这两个长度
boolean flag = true;
for (int m = 0; m <newarray.length ; m++) {
if (((newarray[i][0]>newarray[m][0]&&newarray[m][0]>newarray[j+1][0])||
(newarray[j+1][0]>newarray[m][0]&&newarray[m][0]>newarray[i][0]))&&
((newarray[i][1]>newarray[m][1]&&newarray[m][1]>newarray[j+1][1])||
(newarray[j+1][1]>newarray[m][1]&&newarray[m][1]>newarray[i][1]))){
flag = false;
}
}
// 如果以上的节点差有效,则取其最小值
if(flag) {
int num = Math.min(x1,y1);
// 与已有的长度比较,取最大值
if(max < num) max = num;
}
}
}
return max-1;
}