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

ruff check fixes

Browse Source
This commit is contained in:
Tejaswi Tyagi 2024-10-03 17:56:50 +00:00
parent 6a9ea4ea67
commit 427b1ca685
1 changed files with 7 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

12
dynamic_programming/longest_arithmetic_subsequence.py
View File

@ -1,10 +1,12 @@
"""
Longest Arithmetic Subsequence Problem: Given an array nums of integers, return the length of the longest arithmetic subsequence in nums.
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 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 < seq.length - 1).
- 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 <
seq.length - 1).
"""
def longest_arithmetic_subsequence(nums: list[int]) -> int:
@ -60,7 +62,7 @@ def longest_arithmetic_subsequence(nums: list[int]) -> int:
if __name__ == "__main__":
import doctest
doctest.testmod()
# sample test case
# Sample test case
nums = [3, 6, 9, 12]
expected_length = 4