594. Longest Harmonious Subsequence
来源:互联网 发布:数据侠客行网盘 编辑:程序博客网 时间:2024/06/06 09:47
class Solution(object):
def findLHS(self, nums):
"""
:type nums: List[int]
:rtype: int
"""
count = collections.Counter(nums)
ans = 0
for x in count:
if x+1 in count:
ans = max(ans, count[x] + count[x+1])
def findLHS(self, nums):
"""
:type nums: List[int]
:rtype: int
"""
count = collections.Counter(nums)
ans = 0
for x in count:
if x+1 in count:
ans = max(ans, count[x] + count[x+1])
return ans
求最大值和最小值之间相差1的最长子序列的长度。
即求连续两个数的总个数最大
阅读全文
0 0
- 594. Longest Harmonious Subsequence
- 594. Longest Harmonious Subsequence
- 594. Longest Harmonious Subsequence
- 594. Longest Harmonious Subsequence
- 594. Longest Harmonious Subsequence
- 594. Longest Harmonious Subsequence
- LeetCode 594. Longest Harmonious Subsequence
- [leetcode]594. Longest Harmonious Subsequence
- [LeetCode]594. Longest Harmonious Subsequence
- [leetcode]: 594. Longest Harmonious Subsequence
- [LeetCode]594.Longest Harmonious Subsequence
- LeetCode#594. Longest Harmonious Subsequence
- leetcode 594. Longest Harmonious Subsequence
- LeetCode 594. Longest Harmonious Subsequence
- 【LeetCode】594. Longest Harmonious Subsequence
- LeetCode-594. Longest Harmonious Subsequence(Java)
- [LeetCode]594. Longest Harmonious Subsequence<HashMap>
- 594. Longest Harmonious Subsequence (map)
- C/C++中的实参和形参
- 仿淘宝商品列表切换
- win10上安装acaconda遇到的无法连接到清华镜像的问题
- 设计模式之命令模式
- 纯数据xml通过xslt转换成报表xml
- 594. Longest Harmonious Subsequence
- 关于Android开发中的BroadCastReceive
- IP地址与CIDR
- php 截取缓存,防止lua输出到前台
- JS控制HTML元素的显示和隐藏的2种方法
- 创建java程序线程的三种方式
- 他写出了史上最牛高考满分作文_如今在天猫卖小龙虾
- XGBoost学习
- 通过Driver与DriverManager连接数据库