We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 0c1e5ec commit 8c4c0e2Copy full SHA for 8c4c0e2
1027. Longest Arithmetic Subsequence.py
@@ -0,0 +1,11 @@
1
+class Solution:
2
+ def longestArithSeqLength(self, nums: List[int]) -> int:
3
+
4
+ d = {}
5
6
+ for i in range(len(nums)):
7
+ for j in range(i+1,len(nums)):
8
+ diff = nums[j]-nums[i]
9
+ d[j,diff] = d.get((i,diff),1) +1
10
11
+ return max(d.values())
0 commit comments