import java.util.*;
//时间O(nlog)空间O(1)
public class Solution {
public boolean IsContinuous(int [] numbers) {
Arrays.sort(numbers);
int zero_num = 0;// 统计大小王的数量
int i = 0;
while(numbers[i]==0){
zero_num++;
i++;
}
//interrapt = numbers[i+1]-numbers[i]-1=0表示这两个牌差值为1,是顺子,当interrapt大于0时,表示两牌之间组顺子差多少张牌
int interrapt = 0;// 记录五张牌距离组成顺子还差多少张牌
for(;i<numbers.length-1;i++){
if(numbers[i]==numbers[i+1]) return false;
interrapt = interrapt + numbers[i+1] - numbers[i] -1;
}
return zero_num >= interrapt;
}
}