思路

找规律

过程

代码

class Solution 
{
    bool hash[14] = { 0 };
public:
    bool IsContinuous(vector<int>& nums)
    {
        int maxVal = INT_MIN, minVal = INT_MAX;
        for(auto &e : nums)
        {
            if(e)
            {
                if(hash[e]) return false;
                hash[e] = true;
                if(e < minVal) minVal = e;
                if(e > maxVal) maxVal = e;
            }
        }
        return (maxVal - minVal) <= 4;
    }
};