1458. Max Dot Product of Two Subsequences Hard

1/**
2 * [1458] Max Dot Product of Two Subsequences
3 *
4 * Given two arrays nums1 and <font face="monospace">nums2</font><font face="monospace">.</font>
5 * Return the maximum dot product between non-empty subsequences of nums1 and nums2 with the same length.
6 * 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).
7 *  
8 * Example 1:
9 * 
10 * Input: nums1 = [2,1,-2,5], nums2 = [3,0,-6]
11 * Output: 18
12 * Explanation: Take subsequence [2,-2] from nums1 and subsequence [3,-6] from nums2.
13 * Their dot product is (2*3 + (-2)*(-6)) = 18.
14 * Example 2:
15 * 
16 * Input: nums1 = [3,-2], nums2 = [2,-6,7]
17 * Output: 21
18 * Explanation: Take subsequence [3] from nums1 and subsequence [7] from nums2.
19 * Their dot product is (3*7) = 21.
20 * Example 3:
21 * 
22 * Input: nums1 = [-1,-1], nums2 = [1,1]
23 * Output: -1
24 * Explanation: Take subsequence [-1] from nums1 and subsequence [1] from nums2.
25 * Their dot product is -1.
26 *  
27 * Constraints:
28 * 
29 * 	1 <= nums1.length, nums2.length <= 500
30 * 	-1000 <= nums1[i], nums2[i] <= 1000
31 * 
32 */
33pub struct Solution {}
34
35// problem: https://leetcode.com/problems/max-dot-product-of-two-subsequences/
36// discuss: https://leetcode.com/problems/max-dot-product-of-two-subsequences/discuss/?currentPage=1&orderBy=most_votes&query=
37
38// submission codes start here
39
40impl Solution {
41    pub fn max_dot_product(nums1: Vec<i32>, nums2: Vec<i32>) -> i32 {
42        0
43    }
44}
45
46// submission codes end
47
48#[cfg(test)]
49mod tests {
50    use super::*;
51
52    #[test]
53    fn test_1458() {
54    }
55}
56