HashSet_面試題61. 撲克牌中的順子

class Solution {
    public boolean isStraight(int[] nums) {
        HashSet<Integer> set=new HashSet<>();
        int max=0,min=14;
        for(int num:nums){
            if(num==0) continue;     //跳過大小王
            max=Math.max(max,num);
            min=Math.min(min,num);
            if(set.contains(num)) return false;
            set.add(num);
        }
        return max-min<5;
    }
}

 參考博客鏈接：

https://leetcode-cn.com/problems/bu-ke-pai-zhong-de-shun-zi-lcof/solution/mian-shi-ti-61-bu-ke-pai-zhong-de-shun-zi-ji-he-se/