题解 | #扑克牌顺子#

    public boolean IsContinuous(int [] numbers) {
       int n = numbers.length;
       int[] pai = new int[14];
       int max = 0;
       int min = 15;
        for(int i = 0;i < n;i ++){
            pai[numbers[i]]++;
            if(numbers[i] != 0 && numbers[i] > max){
                max = numbers[i];
            }
            if(numbers[i] != 0 && numbers[i] < min){
                min = numbers[i];
         }
        }
        if(pai[0] == 4){
            return true;
        }else{
            for(int i = 1;i < 14;i ++){
              if(pai[i] > 1 || max - min > 4){
                  return false;
              }
         }
        }
        return true;
    }
}