Longest Harmonious Subsequence LeetCode solution in Python

1
""""""
2

3
from collections import Counter
4

5

6
class Solution:
7
    def findLHS(self, nums: List[int]) -> int:
8
        counter = Counter(nums)
9
        # values=set(nums)
10
        res = 0
11
        # if len(values)==1:return 0
12
        for num in nums:
13
            if num + 1 in counter or num - 1 in counter:
14
                res = max(res, counter[num] + counter.get(num + 1, 0))
15
                res = max(res, counter[num] + counter.get(num - 1, 0))
16

17
        return res
18

19

20
""