44 扑克牌顺序

class Solution {
public:
    bool IsContinuous( vector<int> numbers ) {
        int length = numbers.size();
        if(length != 5)
            return false;
        sort(numbers.begin(),numbers.end());
        int number = 0;
        for(int i = 0;i < length;i++){
            if(numbers[i] == 0)
                number++;
        }
        int gap = 0;
        for(int i = number;i < length-1;i++){
            if(numbers[i+1] - numbers[i] == 0)
                return false;
            gap += (numbers[i+1] - numbers[i] - 1);
        }
        if(gap > number)
            return false;
        else
            return true;
    }
};