class Solution {
public:
bool isStraight(vector<int>& nums) {
vector<int> map(14); //构建哈希集合
int minValue = INT_MAX, maxValue = INT_MIN;
for(int n : nums)
{
if(map[n] >= 1) return false; //重复数字,出错
if(n == 0) continue; //遇到大小王,跳过
minValue = min(minValue, n);
maxValue = max(maxValue, n);
++map[n];
}
return maxValue - minValue <= 4;
}
};