題目:從撲克牌中隨機(jī)抽5張牌医窿,判斷是不是一個順子, 即這5張牌是不是連續(xù)的炊林。2~10為數(shù)字本身姥卢, A為1。 J為11渣聚、Q為12独榴、 為13。小王可以看成任意數(shù)字奕枝。
代碼如下:
package demo;
import java.util.Arrays;
/**
* 撲克牌的順子
*
* @author xiangdonglee
*
*/
public class Test44 {
public static boolean isContinuous(int[] numbers) {
if (numbers == null || numbers.length != 5) {
return false;
}
// 對元素進(jìn)行排序
Arrays.sort(numbers);
int numberOfZero = 0;
int numberOfGap = 0;
for (int i = 0; i < numbers.length && numbers[i] == 0; i++) {
numberOfZero++;
}
// 第一個非0元素的位置
int small = numberOfZero;
int big = small + 1;
while (big < numbers.length) {
if (numbers[small] == numbers[big]) {
return false;
}
numberOfGap += (numbers[big] - numbers[small] - 1);
small = big;
big++;
}
return numberOfGap <= numberOfZero;
}
public static void main(String[] args) {
int[] numbers1 = { 1, 3, 2, 5, 4 };
System.out.println(isContinuous(numbers1));
int[] numbers2 = { 1, 3, 2, 6, 4 };
System.out.println(isContinuous(numbers2));
int[] numbers3 = { 0, 3, 2, 6, 4 };
System.out.println(isContinuous(numbers3));
int[] numbers4 = { 0, 3, 1, 6, 4 };
System.out.println(isContinuous(numbers4));
int[] numbers5 = { 1, 3, 0, 5, 0 };
System.out.println(isContinuous(numbers5));
int[] numbers6 = { 1, 3, 0, 7, 0 };
System.out.println(isContinuous(numbers6));
int[] numbers7 = { 1, 0, 0, 5, 0 };
System.out.println(isContinuous(numbers7));
int[] numbers8 = { 1, 0, 0, 7, 0 };
System.out.println(isContinuous(numbers8));
int[] numbers9 = { 3, 0, 0, 0, 0 };
System.out.println(isContinuous(numbers9));
int[] numbers10 = { 0, 0, 0, 0, 0 };
System.out.println(isContinuous(numbers10));
int[] numbers11 = { 1, 0, 0, 1, 0 };
System.out.println(isContinuous(numbers11));
}
}
運(yùn)行結(jié)果