-
-
Notifications
You must be signed in to change notification settings - Fork 299
/
128.java
58 lines (52 loc) · 1.59 KB
/
128.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
__________________________________________________________________________________________________
sample 2 ms submission
import java.util.Arrays;
/*
* @lc app=leetcode id=128 lang=java
*
* [128] Longest Consecutive Sequence
*/
class Solution {
public int longestConsecutive(int[] nums) {
if (nums == null || nums.length == 0) return 0;
int curr = 1;
int res = 1;
Arrays.sort(nums);
for (int i = 1; i < nums.length; i++) {
if (nums[i] != nums[i - 1]){
if (nums[i] == nums[i - 1] + 1) {
curr++;
} else {
res = Math.max(curr, res);
curr = 1;
}
}
}
return res = Math.max(curr, res);
}
}
__________________________________________________________________________________________________
sample 34232 kb submission
class Solution {
public int longestConsecutive(int[] nums) {
Set<Integer> set = new HashSet<>();
for (int num: nums) {
set.add(num);
}
int res = 0;
for (int i = 0; i < nums.length; i++) {
int temp = 0;
int tempres = 0;
if (!set.contains(nums[i] - 1)) {
temp = nums[i];
tempres = 1;
while (set.contains(++temp)) {
tempres++;
}
}
res = Math.max(res, tempres);
}
return res;
}
}
__________________________________________________________________________________________________