124. 最长连续序列

class Solution:
    """
    @param num: A list of integers
    @return: An integer
    """
    ‘‘‘
    大致思路：
    1.先排序，然后判断下一位是否大于当前，如果大于c += 1,否则c重置，最终返回m
    ‘‘‘
    def longestConsecutive(self, num):
        num.sort()
        num.append(min(num)-1)
        c = 1
        m = 0
        for i in range(len(num)-1):
            if num[i+1] == num[i]:
                continue
            if num[i+1] == num[i] + 1:
                c += 1 
            else:
                if c > m:
                    m = c
                c = 1
        return  m