当前位置:网站首页>模拟卷Leetcode【普通】1218. 最长定差子序列
模拟卷Leetcode【普通】1218. 最长定差子序列
2022-07-06 06:15:00 【邂逅模拟卷】
1218. 最长定差子序列
给你一个整数数组 arr 和一个整数 difference,请你找出并返回 arr 中最长等差子序列的长度,该子序列中相邻元素之间的差等于 difference 。
子序列 是指在不改变其余元素顺序的情况下,通过删除一些元素或不删除任何元素而从 arr 派生出来的序列。
示例 1:
输入:arr = [1,2,3,4], difference = 1
输出:4
解释:最长的等差子序列是 [1,2,3,4]。
示例 2:
输入:arr = [1,3,5,7], difference = 1
输出:1
解释:最长的等差子序列是任意单个元素。
示例 3:
输入:arr = [1,5,7,8,5,3,4,2,1], difference = -2
输出:4
解释:最长的等差子序列是 [7,5,3,1]。
提示:
1 <= arr.length <= 105
-104 <= arr[i], difference <= 104
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/longest-arithmetic-subsequence-of-given-difference
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
代码:
from leetcode_python.utils import *
class Solution:
def __init__(self):
"""计算到每个数,累计有多少长的数列。所有都从0开始计算"""
pass
def longestSubsequence(self, arr: List[int], difference: int) -> int:
res_cnt = {
}
for num in arr:
res_cnt[num] = res_cnt.get(num-difference,0)+1
return max(res_cnt.values())
def test(data_test):
s = Solution()
return s.longestSubsequence(*data_test)
def test_obj(data_test):
result = [None]
obj = Solution(*data_test[1][0])
for fun, data in zip(data_test[0][1::], data_test[1][1::]):
if data:
res = obj.__getattribute__(fun)(*data)
else:
res = obj.__getattribute__(fun)()
result.append(res)
return result
if __name__ == '__main__':
datas = [
[],
]
for data_test in datas:
t0 = time.time()
print('-' * 50)
print('input:', data_test)
print('output:', test(data_test))
print(f'use time:{
time.time() - t0}s')
备注:
GitHub:https://github.com/monijuan/leetcode_python
CSDN汇总:模拟卷Leetcode 题解汇总_卷子的博客-CSDN博客
可以加QQ群交流:1092754609
leetcode_python.utils详见汇总页说明
先刷的题,之后用脚本生成的blog,如果有错请留言,我看到了会修改的!谢谢!
边栏推荐
- Amazon Engineer: eight important experiences I learned in my career
- Company video accelerated playback
- 一文揭开,测试外包公司的真 相
- Application of Lie group in gtsam
- [postman] the monitors monitoring API can run periodically
- 二维码的前世今生 与 六大测试点梳理
- Hypothesis testing learning notes
- Web界面元素的测试
- Resttemplate and feign realize token transmission
- Reading notes of effective managers
猜你喜欢
随机推荐
假设检验学习笔记
D - How Many Answers Are Wrong
E - food chain
【eolink】PC客户端安装
Cognitive introspection
黑猫带你学UFS协议第8篇:UFS初始化详解(Boot Operation)
Sqlmap tutorial (III) practical skills II
功能安全之故障(fault),错误(error),失效(failure)
曼哈顿距离和-打印菱形
GTSAM中李群的运用
MySQL之数据类型
Reading notes of effective managers
Réflexions sur la sécurité des données (réimpression)
The ECU of 21 Audi q5l 45tfsi brushes is upgraded to master special adjustment, and the horsepower is safely and stably increased to 305 horsepower
Buuctf-[gxyctf2019] no dolls (xiaoyute detailed explanation)
[eolink] PC client installation
2022 software testing workflow to know
误差的基本知识
Postman核心功能解析-参数化和测试报告
Embedded point test of app