Max Dot Product of Two Subsequences LeetCode solution in Python

1
# Runtime: 435 ms (Top 93.00%) | Memory: 13.8 MB (Top 100.00%)
2
class Solution:
3
    def maxDotProduct(self, A, B):
4
        dp = [float("-inf")] * (len(B) + 1)
5
        for i in range(len(A)):
6
            prev = float("-inf")
7
            for j in range(len(B)):
8
                product = A[i] * B[j]
9
                prev, dp[j + 1] = dp[j + 1], max(
10
                    dp[j + 1], dp[j], product, prev + product
11
                )
12
        return dp[-1]