mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 11:43:12 +08:00
29 lines
776 B
HTML
29 lines
776 B
HTML
<p>Given two arrays of integers with equal lengths, return the maximum value of:</p>
|
|
|
|
|
|
|
|
<p><code>|arr1[i] - arr1[j]| + |arr2[i] - arr2[j]| + |i - j|</code></p>
|
|
|
|
|
|
|
|
<p>where the maximum is taken over all <code>0 <= i, j < arr1.length</code>.</p>
|
|
|
|
|
|
<p> </p>
|
|
<p><strong>Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> arr1 = [1,2,3,4], arr2 = [-1,4,5,6]
|
|
<strong>Output:</strong> 13
|
|
</pre>
|
|
|
|
<p><strong>Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> arr1 = [1,-2,-5,0,10], arr2 = [0,-2,-1,-7,-4]
|
|
<strong>Output:</strong> 20
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>2 <= arr1.length == arr2.length <= 40000</code></li>
|
|
<li><code>-10^6 <= arr1[i], arr2[i] <= 10^6</code></li>
|
|
</ul>
|