题目描述
给你两个长度相等的整数数组,返回下面表达式的最大值:
|arr1[i] - arr1[j]| + |arr2[i] - arr2[j]| + |i - j|
其中下标 i,j 满足 0 <= i, j < arr1.length。
示例 1:
输入:arr1 = [1,2,3,4], arr2 = [-1,4,5,6]
输出:13
示例 2:
输入:arr1 = [1,-2,-5,0,10], arr2 = [0,-2,-1,-7,-4]
输出:20
提示:
2 <= arr1.length == arr2.length <= 40000
-10^6 <= arr1[i], arr2[i] <= 10^6
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/maximum-of-absolute-value-expression
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
解题思路
class Solution {
public:
int maxAbsValExpr(vector<int>& arr1, vector<int>& arr2) {
int ans = 0,len = arr1.size();
vector<int> flag = {1,-1};
for(auto it1 : flag){
for(auto it2 : flag){
int ma = INT_MIN;
int mi = INT_MAX;
for(int i=0;i<len;++i){
ma = max(ma,arr1[i]*it1+arr2[i]*it2+i);
mi = min(mi,arr1[i]*it1+arr2[i]*it2+i);
}
ans = max(ans,ma-mi);
}
}
return ans;
}
};