问题:
难度:medium
说明:
给出一个整型数组,然后将求出最长连续的(元素前后相差数值 1)子序列区间,要明确是 子序列 连续。
题目连接:https://leetcode.com/problems/longest-consecutive-sequence/
输入范围:
0 <= nums.length <= 105
-109 <= nums[i] <= 109
输入案例:
Example 1:
Input: nums = [100,4,200,1,3,2]
Output: 4
Explanation: The longest consecutive elements sequence is [1, 2, 3, 4]. Therefore its length is 4.
Example 2:
Input: nums = [0,3,7,2,5,8,4,6,0,1]
Output: 9
我的代码:
因为输入范围是 10^5 可能服务器还加了限制,所以如果直接排序处理可能会超时,那么就得On ,只能直接遍历一次数组处理,处理的方法还是有点特别:
1、用 hashmap 存储数组元素
2、每读一个元素,然后就统计一次元素 +- 1 的位置,把长度加起来,并且比较最大值
3、获得长度之后就进行同步,因为长度也代表这个区间是封闭的,所以是将连续区间的头尾也和当前元素位置进行同步
Java:
class Solution {
public int longestConsecutive(int[] nums) {
int longest = 0;
Map<Integer, Integer> cache = new HashMap<>();
for(int i : nums) {
if(!cache.containsKey(i)) {
int left = cache.getOrDefault(i - 1, 0), right = cache.getOrDefault(i + 1, 0), total = 1 + left + right;
cache.put(i, total);
cache.put(i - left, total); // 头尾长距存储, 因为中间的不会再被调用到可以直接存头尾
cache.put(i + right, total);
longest = Math.max(longest, total);
}
}
return longest;
}
}
C++:
class Solution {
public:
int longestConsecutive(vector<int>& nums) {
int longest = 0;
map<int, int> cache;
for(int i = 0, len = nums.size(); i < len; i ++) {
if(!cache[nums[i]]) {
int cur = nums[i], left = cache[cur - 1], right = cache[cur + 1], total = left + right + 1;
cache[cur] = cache[cur - left] = cache[cur + right] = total;
longest = max(longest, total);
}
}
return longest;
}
};