Given two arrays of integers with equal lengths, return the maximum value of:
|arr1[i] - arr1[j]| + |arr2[i] - arr2[j]| + |i - j|
where the maximum is taken over all 0 <= i, j < arr1.length
.
Example 1:
Input: arr1 = [1,2,3,4], arr2 = [-1,4,5,6] Output: 13
Example 2:
Input: arr1 = [1,-2,-5,0,10], arr2 = [0,-2,-1,-7,-4] Output: 20
Constraints:
2 <= arr1.length == arr2.length <= 40000
-10^6 <= arr1[i], arr2[i] <= 10^6
思路:首先将问题分解成简单点的问题
1. 只有一个数组求max(|arr1[i] - arr1[j]|
):直接max-min
2. 只有一个数组求max(|arr1[i] - arr1[j]|+|i - j|
):参考 https://www.geeksforgeeks.org/maximum-value-arri-arrj-j/ 直接分4种情况讨论,每种情况求一个helper数组arr[i]-i,然后求出每个helper的max-min差值,最后的结果就是所有helper数组差值的max(因为abs,一定能取到max,一正一负,abs后必能取到正)
3. 增加一个数组就是拆分成更多的组合就是了
class Solution(object):
def maxAbsValExpr(self, arr1, arr2):
"""
:type arr1: List[int]
:type arr2: List[int]
:rtype: int
"""
res1,res2,res3,res4,res5,res6,res7,res8=[],[],[],[],[],[],[],[]
for i in range(len(arr1)):
a,b=arr1[i],arr2[i]
res1.append(a+b+i)
res2.append(a+b-i)
res3.append(a-b+i)
res4.append(a-b-i)
res5.append(-a+b+i)
res6.append(-a+b-i)
res7.append(-a-b+i)
res8.append(-a-b-i)
cand1 = max(res1)-min(res1)
cand2 = max(res2)-min(res2)
cand3 = max(res3)-min(res3)
cand4 = max(res4)-min(res4)
cand5 = max(res5)-min(res5)
cand6 = max(res6)-min(res6)
cand7 = max(res7)-min(res7)
cand8 = max(res8)-min(res8)
return max([cand1,cand2,cand3,cand4,cand5,cand6,cand7,cand8])
下面这种写法是不合逻辑的,注意区别
class Solution(object):
def maxAbsValExpr(self, arr1, arr2):
"""
:type arr1: List[int]
:type arr2: List[int]
:rtype: int
"""
res=[]
for i in range(len(arr1)):
a,b=arr1[i],arr2[i]
res.append(a+b+i)
res.append(a+b-i)
res.append(a-b+i)
res.append(a-b-i)
res.append(-a+b+i)
res.append(-a+b-i)
res.append(-a-b+i)
res.append(-a-b-i)
return max(res)-min(res)
s=Solution()
print(s.maxAbsValExpr(arr1 = [1,2,3,4], arr2 = [-1,4,5,6]))
print(s.maxAbsValExpr(arr1 = [1,-2,-5,0,10], arr2 = [0,-2,-1,-7,-4]))