剑指offer 61. 扑克牌中的顺子
题目描述
解题思路
class Solution {
public boolean isStraight(int[] nums) {
HashSet<Integer> set = new HashSet<>();
int maxNum = 0, minNum = 14;
for (int num : nums) {
if (num == 0) continue; //遇到大小王直接跳过
maxNum = Math.max(maxNum, num);
minNum = Math.min(minNum, num);
if (!set.add(num)) return false; //如果出现重复元素,直接返回false
}
return maxNum - minNum < 5;
}
}