题解 | #扑克牌顺子#

class Solution {
public:
    bool hash[14] = {0};
    bool IsContinuous(vector<int>& numbers) {
        int x = 0,y = 14;
        for(auto a : numbers)
        {
            if(a)
            {
                if(hash[a]) return false;;
                hash[a] = true;
                x = max(x,a);
                y = min(y,a);
            }
            
        }
        return x-y<=4;
    }
};