Max Dot Product of Two Subsequences

Given two arrays nums1 and nums2.

Return the maximum dot product between non-empty subsequences of nums1 and nums2 with the same length.

A subsequence of a array is a new array which is formed from the original array by deleting some (can be none) of the characters without disturbing the relative positions of the remaining characters. (ie, [2,3,5] is a subsequence of [1,2,3,4,5] while [1,5,3] is not).

 

Example 1:

Input: nums1 = [2,1,-2,5], nums2 = [3,0,-6]
Output: 18
Explanation: Take subsequence [2,-2] from nums1 and subsequence [3,-6] from nums2.
Their dot product is (2*3 + (-2)*(-6)) = 18.

Example 2:

Input: nums1 = [3,-2], nums2 = [2,-6,7]
Output: 21
Explanation: Take subsequence [3] from nums1 and subsequence [7] from nums2.
Their dot product is (3*7) = 21.

思路：dp的物理意义是: nums1 到i，nums2到j情况下，我能够得到的最大的dot sum;

递推就是分5种情况: nums1[i]  nums[j] 分取和不取，那么

dp[i][j] = 

1 取 2 取，分两种情况：我只要 1 & 2 nums[i] * nums[j], 要么我也要前面的dp[i - 1][j - 1] + nums1[i] * nums[j]

1 不取 2 取，dp[i - 1][j]

1 取 , 2不取，dp[i][j - 1]

1 不取，2 不取， dp[i - 1][j - 1];

所有情况取最大，就是当前的最大；

初始值：0, 0 nums1[i] * nums[j];

1st row: 取到当前的最大；

1st col: 取到当前的最大；

class Solution {
    public int maxDotProduct(int[] nums1, int[] nums2) {
        int n = nums1.length;
        int m = nums2.length;
        long[][] dp = new long[n][m];
        long res = Long.MIN_VALUE;
        for(int i = 0; i < n; i++) {
            for(int j = 0; j < m; j++) {
                dp[i][j] = Long.MIN_VALUE;
                if(i == 0 && j == 0) {
                    dp[i][j] = nums1[i] * nums2[j];
                } else if(i == 0 && j - 1 >= 0) {
                    dp[i][j] = Math.max(dp[i][j- 1], nums1[i] * nums2[j]);
                } else if(j == 0 && i - 1 >= 0) {
                    dp[i][j] = Math.max(dp[i - 1][j], nums1[i] * nums2[j]);
                } else {
                    // i >= 1 && j >= 1;
                    dp[i][j] = Math.max(dp[i][j], nums1[i] * nums2[j]);
                    dp[i][j] = Math.max(dp[i][j], dp[i - 1][j - 1] + nums1[i] * nums2[j]);
                    
                    dp[i][j] = Math.max(dp[i][j], Math.max(dp[i - 1][j -1], Math.max(dp[i - 1][j], dp[i][j -1])));
                }
                res = Math.max(res, dp[i][j]);
            }
        }
        return (int)res;
    }
}