扑克牌顺子 --剑指offer

public class Solution {
    public boolean isContinuous(int [] numbers) {
        if(numbers == null || numbers.length < 5){
            return false;
        }
         int min=Integer.MAX_VALUE;
        int max=Integer.MIN_VALUE;
        int[] count=new int[14];
        for(int i =0;i < numbers.length;i ++){
            count[numbers[i]] ++;
            if(numbers[i] == 0 ){
                continue;
            }
            if(count[numbers[i]] > 1){
                return  false;
            }
            if(numbers[i] > max) max = numbers[i];
            if(numbers[i] < min) min = numbers[i];
        }
        if((max - min) < 5) return  true;
        return  false;
    }
}