题解 | #扑克牌顺子#

public:
    bool IsContinuous( vector<int> numbers ) {
        int mp[15];
        int maxn=-1;
        int minn=999;
        for(int i=0;i<numbers.size();i++){
           mp[numbers[i]]++;
            if(numbers[i]!=0){
                maxn=max(numbers[i],maxn);
                minn=min(numbers[i],minn);
            }
            if(mp[numbers[i]]>1&&numbers[i]!=0){//有重复的直接就错了
                return false;
            }
        }
        return maxn-minn<5;//最大最小值差小于5；
    }
};