Skip to content

Commit 4bd4d1c

Browse files
committed
removed trailing spaces
1 parent 506161a commit 4bd4d1c

File tree

1 file changed

+3
-3
lines changed

1 file changed

+3
-3
lines changed

Diff for: dynamic_programming/longest_arithmetic_subsequence.py

+3-3
Original file line numberDiff line numberDiff line change
@@ -1,11 +1,11 @@
11
"""
2-
Longest Arithmetic Subsequence Problem: Given an array nums of integers,
2+
Longest Arithmetic Subsequence Problem: Given an array nums of integers,
33
return the length of the longest arithmetic subsequence in nums.
44
55
Note that:
6-
- A subsequence is an array that can be derived from another array by
6+
- A subsequence is an array that can be derived from another array by
77
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
8+
- A sequence seq is arithmetic if seq[i + 1] - seq[i] are all the same value
99
(for 0 <= i < seq.length - 1).
1010
"""
1111

0 commit comments

Comments
 (0)