扑克牌顺子

//参考剑指offer,统计连续间隔数和0的数
class Solution {
public:
	static bool compare(int a, int b){ return a < b; }
	bool IsContinuous(vector<int> numbers) {
		int len = numbers.size();
		int numberofZero = 0, numberofDiff = 0;
		if (len <= 0)return false;
		sort(numbers.begin(), numbers.end(), compare);
		for (int i = 0; i < len; i++)
			if (numbers[i] == 0)numberofZero++;
			
		int low = numberofZero;
		int high = low + 1;
		while (high < len)
		{
            if(numbers[high]==numbers[low])return false;//有对子
			numberofDiff += numbers[high]- numbers[low] - 1;
			low = high;
			high++;
		}                                
		return numberofZero>=numberofDiff ? true : false;
	}
};