import java.util.Arrays;
public class Solution {
public boolean isContinuous(int [] numbers) {
if(numbers==null || numbers.length < 5){
return false;
}
//对数组进行从小到大的排序
Arrays.sort(numbers);
//大小王的数量
int zeroNumbers=0;
for(int i=0;i<numbers.length;i++){
if(numbers[i] ==0){
zeroNumbers++;
}else{
break;
}
}
int startIndex=zeroNumbers;
int endIndex=zeroNumbers+1;
int result=0;
while(endIndex < numbers.length){
if(numbers[endIndex] == numbers[startIndex]){
//数组中有两个元素相等
return false;
}
//求前后两个元素的值并且减掉1,得到两个元素之间空缺了几个元素
result+=numbers[endIndex] - numbers[startIndex] -1;
startIndex++;
endIndex++;
}
return (result <=zeroNumbers ? true : false );
}
}
public class Solution {
public boolean isContinuous(int [] numbers) {
if(numbers==null || numbers.length < 5){
return false;
}
//对数组进行从小到大的排序
Arrays.sort(numbers);
//大小王的数量
int zeroNumbers=0;
for(int i=0;i<numbers.length;i++){
if(numbers[i] ==0){
zeroNumbers++;
}else{
break;
}
}
int startIndex=zeroNumbers;
int endIndex=zeroNumbers+1;
int result=0;
while(endIndex < numbers.length){
if(numbers[endIndex] == numbers[startIndex]){
//数组中有两个元素相等
return false;
}
//求前后两个元素的值并且减掉1,得到两个元素之间空缺了几个元素
result+=numbers[endIndex] - numbers[startIndex] -1;
startIndex++;
endIndex++;
}
return (result <=zeroNumbers ? true : false );
}
}