剑指45-扑克牌顺子

#include<map>
#include<vector>

using namespace std;

class Solution {
public:
    bool IsContinuous(vector<int> numbers) {
        if (!numbers.size()) return false;
        map<int, int> res_map;
        for (auto item : numbers)
        {
            if (res_map[item] >= 1 && item != 0) return false;
            else res_map[item]++;
        }
        int max_num = max(numbers);
        int min_num = min(numbers);
        if (max_num - min_num + 1 > numbers.size()) return false;
        return true;
    }

    int max(vector<int> numbers) {
        int res = -1;
        for (auto item : numbers) if (item > res && item != 0) res = item;
        return res;
    }

    int min(vector<int> numbers) {
        int res = 20;
        for (auto item : numbers) if (item < res && item != 0) res = item;
        return res;
    }
};