脚撕LeetCode(剑指Offer61)Easy

public boolean isStraightMe(int[] nums) {
    int max = 0, min = 14;
    Set<Integer> set = new HashSet<>();
    for (int i = 0; i < nums.length; i++) {
        if(0 == nums[i]) continue;
        if(set.contains(nums[i])) return false;
        max = Math.max(max, nums[i]);
        min = Math.min(min, nums[i]);
        set.add(nums[i]);
    }
    return max - min < 5;
}

public boolean isStraight(int[] nums) {
    int joker = 0;
    Arrays.sort(nums);
    for (int i = 0; i < 4; i++) {
        if (0 == nums[i]) {
            joker++;
        } else if (nums[i] == nums[i + 1]) {
            return false;
        }
    }
    return (nums[4] - nums[joker]) < 5;
}