LeetCode-Longest Consecutive Sequence

tymy

于 2013-08-21 19:58:41 发布

阅读量447

点赞数

分类专栏： leetCode 文章标签： LeetCode IT面试 OJ 算法

本文链接：https://blog.csdn.net/u010266551/article/details/10161101

版权

leetCode 专栏收录该内容

123 篇文章 0 订阅

订阅专栏

class Solution {
public:
    int longestConsecutive(vector<int> &num) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        int maxLen = 0;
        map<int, pair<int, int> > m_map;
        for (vector<int>::iterator iter = num.begin(); iter != num.end(); ++iter)
        {
            if (m_map.count(*iter) == 0)
            {
                m_map.insert(make_pair(*iter, make_pair(*iter, *iter)));
            }
        }
        map<int, pair<int, int> >::iterator iter;
        for (iter = m_map.begin(); iter != m_map.end(); ++iter)
        {
            int val = iter->first;
            map<int, pair<int, int> >::iterator iter1 = m_map.find(val - 1);
            if (iter1 != m_map.end())
            {
                iter->second.first = iter1->second.first;
            }
            iter1 = m_map.find(val + 1);
            if (iter1 != m_map.end())
            {
                iter->second.second = iter1->second.second;
            }
            maxLen = max(maxLen, iter->second.second - iter->second.first + 1);
        }
        return maxLen;
    }
};