[LeetCode] Longest 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.

解题思路:

扫描数组,对每个数向比它的和比它小的扩展,计算最大序列.遍历时候用一个hashmap保存是否已经遍历过,如果遍历过,就略过.因此只需要扫描一遍即可.

解题代码:

class Solution {
public:
    int longestConsecutive(vector<int> &num) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        map<int, int> hashtable;
        map<int, int> visited;
        int max = 0;
        
        for(int i = 0; i < num.size(); i++)
        {
            hashtable[num[i]] = 1;
        }
        
        for(int i = 0; i < num.size(); i++)
        {
            if(visited[num[i]] == 1)
            {
                continue;
            }
            
            bool up = true, down = true;
            int up_cur = num[i], down_cur = num[i];
            
            int up_len = 0, down_len = 0;
            while(up || down)
            {
                
                if(up)
                {
                    up_cur++;
                    if(hashtable[up_cur] == 1)
                    {
                        visited[up_cur] = 1;
                        up_len++;
                    }
                    else
                    {
                        up = false;
                    }
                }
                if(down)
                {
                    down_cur--;
                    if(hashtable[down_cur] == 1)
                    {
                        visited[down_cur] = 1;
                        down_len++;
                    }
                    else
                    {
                        down = false;
                    }
                }
            }
            if(up_len + down_len + 1 > max)
            {
                max = up_len + down_len + 1;
            }
        }
        
        return max;
    }
};