We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 506161a commit 4bd4d1cCopy full SHA for 4bd4d1c
dynamic_programming/longest_arithmetic_subsequence.py
@@ -1,11 +1,11 @@
1
"""
2
-Longest Arithmetic Subsequence Problem: Given an array nums of integers,
+Longest Arithmetic Subsequence Problem: Given an array nums of integers,
3
return the length of the longest arithmetic subsequence in nums.
4
5
Note that:
6
-- A subsequence is an array that can be derived from another array by
+- A subsequence is an array that can be derived from another array by
7
deleting some or no elements without changing the order of the remaining elements.
8
-- A sequence seq is arithmetic if seq[i + 1] - seq[i] are all the same value
+- A sequence seq is arithmetic if seq[i + 1] - seq[i] are all the same value
9
(for 0 <= i < seq.length - 1).
10
11
0 commit comments