lc594. Longest Harmonious Subsequence

最新推荐文章于 2025-08-12 18:06:10 发布

转载最新推荐文章于 2025-08-12 18:06:10 发布 · 139 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：https://juejin.im/post/5d0b2f8ff265da1bc5526956

文章标签：

#python

博客介绍了求整数数组中最长和谐子序列长度的问题，和谐数组指最大与最小值差为1的数组。给出示例，输入[1,3,2,2,5,2,3,7]，输出为5，对应最长和谐子序列[3,2,2,2,3]。思路是用collections.Counter获取元素出现次数，遍历求连续数字出现最大值，代码用Python3实现。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Longest Harmonious Subsequence Easy

423

Favorite

Share We define a harmounious array as an array where the difference between its maximum value and its minimum value is exactly 1.

Now, given an integer array, you need to find the length of its longest harmonious subsequence among all its possible subsequences.

Example 1:

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

Note: The length of the input array will not exceed 20,000.

思路：collections.Counter(nums) 获取每个元素出现的次数，遍历，获取连续数字出现的最大值

代码：python3

class Solution:
    def findLHS(self, nums: List[int]) -> int:
        dic=collections.Counter(nums)
        count=0
        for key in dic:
            if (key+1) in dic:
                count=max(count,dic[key]+dic[key+1])
        return count
复制代码

转载于:https://juejin.im/post/5d0b2f8ff265da1bc5526956