mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-10 18:48:13 +08:00
39 lines
1.6 KiB
HTML
39 lines
1.6 KiB
HTML
<p>Given two arrays <code>nums1</code> and <code><font face="monospace">nums2</font></code><font face="monospace">.</font></p>
|
|
|
|
<p>Return the maximum dot product between <strong>non-empty</strong> subsequences of nums1 and nums2 with the same length.</p>
|
|
|
|
<p>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, <code>[2,3,5]</code> is a subsequence of <code>[1,2,3,4,5]</code> while <code>[1,5,3]</code> is not).</p>
|
|
|
|
<p> </p>
|
|
<p><strong class="example">Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> nums1 = [2,1,-2,5], nums2 = [3,0,-6]
|
|
<strong>Output:</strong> 18
|
|
<strong>Explanation:</strong> Take subsequence [2,-2] from nums1 and subsequence [3,-6] from nums2.
|
|
Their dot product is (2*3 + (-2)*(-6)) = 18.</pre>
|
|
|
|
<p><strong class="example">Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> nums1 = [3,-2], nums2 = [2,-6,7]
|
|
<strong>Output:</strong> 21
|
|
<strong>Explanation:</strong> Take subsequence [3] from nums1 and subsequence [7] from nums2.
|
|
Their dot product is (3*7) = 21.</pre>
|
|
|
|
<p><strong class="example">Example 3:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> nums1 = [-1,-1], nums2 = [1,1]
|
|
<strong>Output:</strong> -1
|
|
<strong>Explanation: </strong>Take subsequence [-1] from nums1 and subsequence [1] from nums2.
|
|
Their dot product is -1.</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>1 <= nums1.length, nums2.length <= 500</code></li>
|
|
<li><code>-1000 <= nums1[i], nums2[i] <= 1000</code></li>
|
|
</ul>
|