[剑指offer] 45. 扑克牌顺子

class Solution
{
  public:
    bool IsContinuous(vector<int> numbers)
    {
        if (numbers.empty())
            return false;
        sort(numbers.begin(), numbers.end());
        int zeros = 0;
        for (int i = 0; i < 5; i++)
        {
            if (numbers[i] == 0)
                zeros++;
        }
        int count = 0;
        if (zeros <= 3)
        {
            for (int i = zeros; i < 4; i++)
            {
                count += numbers[i + 1] - numbers[i];
            }
            return (count <= 4 && count > 0) ? true : false;
        }
        else if (zeros == 4)
            return true;
        return false;
    }
};