Longest Arithmetic Subsequence LeetCode solution in Python

1
# Runtime: 7591 ms (Top 12.82%) | Memory: 21.8 MB (Top 96.69%)
2
class Solution:
3
    def longestArithSeqLength(self, nums: List[int]) -> int:
4
        dp = [[1] * 1001 for i in range(len(nums))]
5
        for i in range(len(nums)):
6
            for j in range(i + 1, len(nums)):
7
                d = nums[j] - nums[i] + 500
8
                dp[j][d] = max(dp[i][d] + 1, dp[j][d])
9
        return max([max(i) for i in dp])