import java.util.Arrays;
public class Solution {
public boolean isContinuous(int [] numbers) {
int numZero=0;
int numInterval=0;
int length=numbers.length;
if(length==0)
return false;
Arrays.sort(numbers);
for(int i=0;i<length-1;i++)
{
if(numbers[i]<0||numbers[i]>13)
return false;
if(numbers[i]==0)
{
numZero+=1;
continue;
}
if(numbers[i]==numbers[i+1])
{
return false;
}
numInterval+=numbers[i+1]-numbers[i]-1;
}
if(numZero>=numInterval)
{
return true;
}
return false;
}
}
编程题]扑克牌顺子
猜你喜欢
转载自blog.csdn.net/qq_42039996/article/details/84637256
今日推荐
周排行