https://leetcode-cn.com/problems/longest-consecutive-sequence/
e.g. 4 1 3 2
4 - 3
|
1 -2
[brainstorm]
1 union find, set grow bigger. finally, find biggest set size.
2 while seeing 3,
add 3 to {4}, become {3,4}
3 seeing 2
add 2 to {1} and {3,4}
4 how to locate set?
5 seeing number, how to merge with neighbor set?
l, r
no l, r
l, no r
no l, no r
use top down.
when seems multiple cases instead of one case,
try extract this part as method, as currently you are in top level.
cases handle should be another level.
[brainstorm end]
[code]
class Solution {
Map<Integer, Set> map = new HashMap<>();
public int longestConsecutive(int[] nums) {
int n = nums.length;
for(int i=0;i<n;i++){
int num = nums[i];
helper(num);
}
int ret=0;
for(int i=0;i<n;i++){
Set<Integer> set = map.get(nums[i]);
ret = Math.max(ret, set.size());
}
return ret;
}
void helper(int num){
int l = num-1;
int r = num+1;
if(map.containsKey(l) && map.containsKey(r)){
Set lset = map.get(l);
Set<Integer> rset = map.get(r);
Set set = lset.size()>rset.size()?lset:rset;
Set<Integer> rem = lset.size()>rset.size()?rset:lset;
set.add(num);
map.put(num, set);
for(int elem: rem){
set.add(elem);
map.put(elem, set);
}
}
else if(map.containsKey(l) && !map.containsKey(r)){
Set set = map.get(l);
set.add(num);
map.put(num, set);
}
else if(!map.containsKey(l) && map.containsKey(r)){
Set set = map.get(r);
set.add(num);
map.put(num, set);
}
else if(!map.containsKey(l) && !map.containsKey(r)){
Set<Integer> set = new HashSet<>();
set.add(num);
map.put(num, set);
}
}
}