剑指 Offer 61. 扑克牌中的顺子

class Solution {
    public boolean isStraight(int[] nums) {
        Set<Integer> set = new HashSet<>();
        int max = 0, min = 13;
        for (int x : nums) {
            if (x == 0) {
                continue;
            }
            if (set.contains(x)) {
                return false;//非零数字重复出现
            }
            set.add(x);
            max = Math.max(max, x);
            min = Math.min(min, x);
        }
        return max - min <= 4;
    }
}