-
Notifications
You must be signed in to change notification settings - Fork 2
/
1-44-ContinousCards_44.java
64 lines (51 loc) · 1.53 KB
/
1-44-ContinousCards_44.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
package swordOffer;
import java.util.Arrays;
import java.util.Scanner;
/**
* @author WuPing
* @date 2016年8月27日 下午2:25:17
* @version 1.0
*/
public class ContinousCards_44 {
public static boolean isContinuous(int[] numbers) {
if(numbers == null || numbers.length<1){
return false;
}
Arrays.sort(numbers);
int numberOfZero = 0;
int numberOfGap = 0;
// 统计数组中0的个数
for(int i=0; i<numbers.length && numbers[i]==0; i++){
numberOfZero++;
}
// 统计数组中的间隔数目
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) ? false : true;
}
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
while(scanner.hasNext()){
String str = scanner.nextLine();
if (str != null && !str.trim().equals("")) {
String[] arrayStr = str.split(",");
int[] numbers = new int[arrayStr.length];
for (int i = 0; i < arrayStr.length; i++) {
numbers[i] = Integer.parseInt(arrayStr[i]);
}
boolean result = isContinuous(numbers);
System.out.print(result);
}
}
scanner.close();
}
}