-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathJudgeSequence.java
More file actions
56 lines (54 loc) · 1.14 KB
/
JudgeSequence.java
File metadata and controls
56 lines (54 loc) · 1.14 KB
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
import java.util.Arrays;
public class Solution {
public boolean isContinuous(int [] numbers) {
if(numbers==null || numbers.length==0)
return false;
Arrays.sort(numbers);
int zeroCount =0, gapCount=0;
int i=0;
while (i < numbers.length && numbers[i] == 0) {
zeroCount++;
i++;
}
int prev =numbers[i++];
for(;i<numbers.length;i++)
{
if(prev==numbers[i])
return false;
gapCount+=numbers[i]-prev-1;
prev=numbers[i];
}
if(zeroCount>=gapCount){
return true;
}
else
return false;
}
/*
public boolean isContinuous(int [] numbers) {
int[]d = new int[14];
d[0] = -5;
int len = numbers.length;
int max = -1;
int min = 14;
for(int i =0;i<len;i++){
d[numbers[i]]++;
f(numbers[i] == 0){
continue;
}
if(d[numbers[i]]>1){
return false;
}
if(numbers[i] >max){
max = numbers[i];
} if(numbers[i] <min){
min = numbers[i];
}
}
if(max -min<5){
return true;
}
return false;
}
*/
}