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

line length shortened

Browse Source
This commit is contained in:
Tejaswi Tyagi 2024-10-03 18:06:25 +00:00
parent ab88a43d8c
commit 506161a4cf
1 changed files with 6 additions and 6 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,12 +1,12 @@
""" """
Longest Arithmetic Subsequence Problem: Given an array nums of integers, return the length Longest Arithmetic Subsequence Problem: Given an array nums of integers,
of the longest arithmetic subsequence in nums. return the length of the longest arithmetic subsequence in nums.
Note that: 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
elements without changing the order of the remaining elements. 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
seq.length - 1). (for 0 <= i < seq.length - 1).
""" """