index
title: 扑克牌顺子 date: 2019-08-21T11:00:41+08:00 draft: false categories: offer
题目
解题思路
public boolean isContinuous(int[] numbers) {
if (numbers == null || numbers.length < 5) return false;
Arrays.sort(numbers);
int count = 0;
int zeroCount = 0;
int pre = -1;
for (int number : numbers) {
if (number == 0) {
zeroCount++;
continue;
}
if (pre == -1) pre = number;
else {
int t = number - pre - 1;
if (t > 0) {
count += t;
} else if (t < 0) return false;
pre = number;
}
}
if (count == 0) return true;
else return count == zeroCount;
}Last updated