题解 | 扑克牌顺子

import java.util.*;


public class Solution {
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     *
     * @param numbers int整型一维数组
     * @return bool布尔型
     */
    public boolean IsContinuous (int[] numbers) {
        int min = 13;
        int max = 0;
        Set<Integer> set = new HashSet<Integer>();
        int zeroCount = 0;
        for (int i = 0; i < numbers.length; i++) {
            if (min > numbers[i] && numbers[i] != 0) {
                min = numbers[i];
            }
            if (max < numbers[i] && numbers[i] != 0) {
                max = numbers[i];
            }
            if (numbers[i] != 0) {
                set.add(numbers[i]);
            } else {
                zeroCount++;
            }
        }
        if (zeroCount == 0) {
            if (set.size() == 5 && max - min == 4) {
                return true;
            }
        } else {
            //0的数量+数字的数量小于5，则不满足
            if (set.size() + zeroCount < 5) {
                return false;
            } else {
                if (max - min <= 4) {
                    return true;
                }
            }
        }
        return false;
    }
}