mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-04-15 02:07:36 +00:00
Code Issues Packages Projects Releases Wiki Activity

[pre-commit.ci] auto fixes from pre-commit.com hooks

Browse Source 
for more information, see https://pre-commit.ci
This commit is contained in:
pre-commit-ci[bot] 2024-10-03 17:58:21 +00:00
parent cf444d645f
commit bdbe42ae22
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
dynamic_programming/longest_arithmetic_subsequence.py
View File

@ -1,11 +1,11 @@
"""
Longest Arithmetic Subsequence Problem: Given an array nums of integers, return the length
Longest Arithmetic Subsequence Problem: Given an array nums of integers, return the length
of the longest arithmetic subsequence in nums.
Note that:
- A subsequence is an array that can be derived from another array by deleting some or no
- A subsequence is an array that can be derived from another array by deleting some or no
elements without changing the order of the remaining elements.
- A sequence seq is arithmetic if seq[i + 1] - seq[i] are all the same value (for 0 <= i <
- A sequence seq is arithmetic if seq[i + 1] - seq[i] are all the same value (for 0 <= i <
seq.length - 1).
"""