-
Notifications
You must be signed in to change notification settings - Fork 0
/
LongestConse.java
57 lines (57 loc) · 1.89 KB
/
LongestConse.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
import java.util.*;
//longest consecutive
class LongestConse {
public int longestConsecutive(int[] nums) {int result = 0;
if (nums.length > 0) {
if (nums.length < 1000) {
Arrays.sort(nums);
int current = 0;
for (int i = 1; i < nums.length; i++) {
if (nums[i] != nums[i - 1]) {
if (nums[i] - nums[i - 1] == 1) {
current++;
} else {
if (current + 1 > result) {
result = current + 1;
}
current = 0;
}
}
}
if (current + 1 > result) {
result = current + 1;
}
} else {
int min = Integer.MAX_VALUE;
int max = Integer.MIN_VALUE;
for (int num : nums) {
if (num > max) {
max = num;
}
if (num < min) {
min = num;
}
}
byte[] bits = new byte[max - min + 1];
for (int num : nums) {
bits[num - min] = 1;
}
int current = 0;
for (byte bit : bits) {
if (bit > 0) {
current++;
} else {
if (current > result) {
result = current;
}
current = 0;
}
}
if (current > result) {
result = current;
}
}
}
return result;
}
}