剑指offer 扑克牌顺子

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