class Solution {
public:
    bool isStraight(vector<int>& nums) {
        //集合记录是否包含数字
        unordered_set<int> re;
        int maxnum=0,minnum=14;
        for(auto x:nums){
            if(!x) continue;
            if(re.find(x)!=re.end()){
                return false;
            }
            else{
                re.emplace(x);
            }
            maxnum=max(maxnum,x);
            minnum=min(minnum,x);
        }
        return (maxnum-minnum)<5;
    }
};

2.排序后遍历

class Solution {
public:
    bool isStraight(vector<int>& nums) {
        sort(nums.begin(),nums.end());
        int count=0;
        for(int i=0;i<nums.size()-1;i++){
            if(nums[i]==0){
                count++;
            }
            else{
                if(nums[i]==nums[i+1]){
                    return false;
                }
            }
        }
        return (nums[4]-nums[count])<5;
    }
};