【剑指offer】61、扑克牌中的顺子

class Solution {
public:
    bool IsContinuous( vector<int> numbers ) {
        if (numbers.size() != 5 )
            return false;
        int length = numbers.size();
        sort(numbers.begin(), numbers.end());
        int num_space = 0, num_zero = 0;
        for (int i = 0; i < length; i++)
        {
            if (numbers[i] == 0)
                num_zero++;
        }
        for (int i = num_zero; i < length - 1; i++)
        {
            if (numbers[i+1] == numbers[i])   
                return false;
            // 统计空缺总数，如果是连续的，则为0
            num_space += numbers[i+1] - numbers[i] - 1;
        }
        
        return (num_space > num_zero)?false:true;
    }