leetcode

Leetcode submissions
git clone git://git.laack.co/leetcode.git
Log | Files | Refs | README

find-longest.py (629B)

      1 class Solution:
      2     def findLHS(self, nums: List[int]) -> int:
      3 
      4         counts = {}
      5 
      6         for num in nums:
      7             if num in counts:
      8                 counts[num] += 1
      9             else:
     10                 counts[num] = 1
     11 
     12         max_len = 0
     13 
     14         for key in counts:
     15             if key - 1 in counts:
     16                 current = counts[key - 1] + counts[key]
     17                 if current > max_len:
     18                     max_len = current
     19 
     20             if key + 1 in counts:
     21                 current = counts[key + 1] + counts[key]
     22                 if current > max_len:
     23                     max_len = current
     24 
     25         return max_len