java 判断一个数组中的数值是否连续相邻的方法

package datastruct.usearray;public class JudgeAdjacent {	  private static boolean judege(int a[]) {		  int min=Integer.MAX_VALUE;		  int max=Integer.MIN_VALUE;		 		  for (int i = 0; i < a.length; i++) {			 if (a[i]!=0) {				 if (min>a[i]) {					min=a[i];				}				 if (max<a target="_blank">a.length-1) {			return false;		}else {			return true;					}		  	}    public static void main(String[] args) {     int a[]={8,5,0,10,6,7,0,0};			if (judege(a)) {				System.out.println("该数组是相邻的！");			}else {				System.out.println("该数组不是相邻的！");			}		}}</a>