【leetcode刷题】T52-最长和谐子序列

Input: [1,3,2,2,5,2,3,7]
Output: 5
Explanation: The longest harmonious subsequence is [3,2,2,2,3].

输入: [1,3,2,2,5,2,3,7]
输出: 5
原因: 最长的和谐数组是：[3,2,2,2,3].

class Solution(object):
    def findLHS(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        min0 = sys.maxsize
        max0 = -sys.maxsize
        d = {}
        for n in nums:
            d[n] = d.get(n, ) + 
            min0 = min(min0, n)
            max0 = max(max0, n)
        res = 
        for i in d.keys():
            if i+ in d:
                res = max(res, d[i] + d[i+])
        return res