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

ruff fixes

Browse Source
This commit is contained in:
Tejaswi Tyagi 2024-10-03 18:02:25 +00:00
parent cf444d645f
commit 3198708845
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. 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 deleting some or no
elements without changing the order of the remaining elements. 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). seq.length - 1).
""" """