mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-06 07:51:41 +08:00
存量题库数据更新
This commit is contained in:
@@ -5,14 +5,14 @@
|
||||
<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 class="example">Example 1:</strong></p>
|
||||
|
||||
<pre>
|
||||
<pre>
|
||||
<strong>Input:</strong> arr1 = [1,2,3,4], arr2 = [-1,4,5,6]
|
||||
<strong>Output:</strong> 13
|
||||
</pre>
|
||||
|
Reference in New Issue
Block a user