import java.util.Arrays;
public class Solution {
    public boolean isContinuous(int [] numbers) {
        //数组不能为空，也不能长度小于5
        if (numbers == null || numbers.length < 5) {
            return false;
        }
        //数组排序,n很小考虑时间复杂度没意义
        Arrays.sort(numbers);
        //统计0的个数
        int zeroCount = 0;
        int gapCount = 0;
        for (int i = 0; i < numbers.length; i++) {
            if (numbers[i] == 0){
                zeroCount++;
            }
        }
        //统计gap个数，并排除数组有重复的数
        //第一个不为0的数
        int small = zeroCount;
        while (small <= numbers.length - 2){
            if (numbers[small] == numbers[small + 1]){
                return false;
            }
            gapCount += (numbers[small + 1] - numbers[small] - 1);
            small++;
        }
        //判断gap和zero关系
        if (gapCount <= zeroCount){
            return true;
        } else {
            return false;
        }
    }
    
    
}