Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 594 with 22 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 594 # by problem number
lcpy gen -s longest_harmonious_subsequence # by problem name
1.
Given an integer array nums, return the length of its longest harmonious subsequence among all its possible subsequences.
Input: nums = [1,3,2,2,5,2,3,7]
Output: 5
Explanation: The longest harmonious subsequence is [3,2,2,2,3].
Input: nums = [1,2,3,4]
Output: 2
Explanation: The longest harmonious subsequences are [1,2], [2,3], and [3,4], all of which have a length of 2.
Input: nums = [1,1,1,1]
Output: 0
Explanation: No harmonious subsequence exists.
from collections import Counter
class Solution:
# Time: O(n)
# Space: O(n)
def find_lhs(self, nums: list[int]) -> int:
counts = Counter(nums)
longest = 0
for value, count in counts.items():
if value + 1 in counts:
longest = max(longest, count + counts[value + 1])
return longest
| Time | Space |
|---|---|
| O(n) | O(n) |