Sword To Offer 045 - 扑克牌顺子

class Solution {
public:
    bool IsContinuous(vector<int> numbers) {
        if(numbers.empty()) {
            return false;
        }
        int count[14] = {0};
        int minNumber = 14;
        int maxNumber = -1;
        for(auto number : numbers) {
            if(number == 0) {
                continue;
            }
            minNumber = min(minNumber, number);
            maxNumber = max(maxNumber, number);
            count[number]++;
            if(count[number] > 1) {
                return false;
            }
        }
        return maxNumber - minNumber < 5;
    }
};