扑克牌顺子

public boolean isContinuous(int [] numbers) {
        if(numbers==null||numbers.length==0)
        {
            return false;
        }
        Arrays.sort(numbers); 
        int count=0;
        int need = 0;  
        for(int i=0;i<numbers.length-1;i++)
        {
            if(numbers[i]==0)
            {
                count++;
                continue;
            }
            if(numbers[i+1]-numbers[i]==0)
            {
                return false;
            }
            if(numbers[i+1]-numbers[i]==1)
            {
                continue;
            }
            else
            {
                need += (numbers[i+1] - numbers[i] -1);
            }
        }
        if(need>count)
        {
            return false;
        }
        else{
            return true;
        }
    }