Leetlongest-consecutive-sequence

题目描述

Given an unsorted array of integers, find the length of the longest consecutive elements sequence.

For example,
Given[100, 4, 200, 1, 3, 2],
The longest consecutive elements sequence is[1, 2, 3, 4]. Return its length:4.

Your algorithm should run in O(n) complexity.

解题思路： O(n)想到了hashmap  具体操作如下：

• 遍历数组，将每个位置的值作为key，放入hashmap中，value都设为false
• 第二遍遍历数组，判断hashmap中对应的value是否是false，如果是false，则没碰到过；如果是true，则之前算连续的时候碰到过
• 如果value是false，则一直找hashmap中连续的上界以及下届，同时在找连续的上界和下届时候，碰到这个数，设置value为true

import java.util.*;
public class Solution {
    public int longestConsecutive(int[] num) {
        int maxLength = 0;
		HashMap<Integer, Boolean> t = new HashMap<>();
		for (int i = 0; i < num.length; i++) {
			t.put(num[i], false);
		}
		for (int i = 0; i < num.length; i++) {
			if (t.get(num[i])) {
				continue;
			}
			int k = num[i] - 1, l = num[i] + 1;
			int left = num[i], right = num[i];
			while (t.containsKey(k)) {
				t.put(k, true);
				left = k;
				k--;
			}
			
			while (t.containsKey(l)) {
				t.put(l, true);
				right = l;
				l++;
			}
			//System.out.println(left + " : " + right);
			int len = right - left + 1;
			maxLength = Math.max(maxLength, len);
 		}
		return maxLength;
    }
}