题解 | #扑克牌顺子#

很容易理解，先从小到大排序，然后判断零的个数。

public:
    bool IsContinuous( vector<int> numbers ) {
        sort(numbers.begin(), numbers.end());
        int i = 0, j = 0;
        while (numbers[i] == 0) {
            i++;
            j++;
        }
        int num = numbers[i];
        i++;
        for (; i < numbers.size(); i++) {
            while (numbers[i] != num + 1) {
                if (j > 0) {
                    j--;
                    num++;
                } else return false;
            }
            num = numbers[i];
        }
        return true;
    }
};