扑克牌顺子

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