【leetcode 简单】 第一百四十六题 最长和谐子序列

from collections import Counter
class Solution:
    def findLHS(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        new_nums=Counter(nums)
        tmp = 0
        lastkey,lastvalue=None,None
        for key,value in sorted(new_nums.items()):
            if lastkey is not None and lastkey +1 ==key:
                tmp = max(tmp,value+lastvalue)
            lastkey,lastvalue=key,value
        return tmp