题解 | #扑克牌顺子#

class Solution {
public:
    bool IsContinuous( vector<int> numbers ) {
        int zero_nums = 0;
        int insert_nums = 0;
        sort(numbers.begin(), numbers.end());
        
        for(int i=0; i<numbers.size()-1; i++){
            if(numbers[i] == 0){
                zero_nums += 1;
                continue;
            }
            if(numbers[i] == numbers[i+1]){
                return false;
            }
            insert_nums += (numbers[i+1] - numbers[i] - 1);
        }
        
        if(zero_nums <= 4 && zero_nums >= insert_nums){
            return true;
        }
        return false;
    }
};