LeetCode每日一题(1131. Maximum of Absolute Value Expression)

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

---

|xi - xj| + |yi - yj| + |i - j|

(xi - xj) + (yi - yj) + (i - j) => (xi + yi + i) - (xj + yj + j)
(xi - xj) - (yi - yj) + (i - j) => (xi - yi + i) - (xj - yj + j)
(xi - xj) + (yi - yj) - (i - j) => (xi + yi - i) - (yj + yi - j)
(xi - xj) - (yi - yj) - (i - j) => (xi - yi - i) - (xj - yj - j)

---

impl Solution {
    pub fn max_abs_val_expr(arr1: Vec<i32>, arr2: Vec<i32>) -> i32 {
        let points =  arr1.into_iter().zip(arr2).enumerate().fold(vec![vec![]; 4], |mut l, (i, (v1, v2))| {
            l[0].push(v1 + v2 + i as i32);
            l[1].push(v1 + v2 - i as i32);
            l[2].push(v1 - v2 + i as i32);
            l[3].push(v1 - v2 - i as i32);
            l
        });
        points.into_iter().map(|l| {
            l.iter().max().unwrap() - l.iter().min().unwrap()
        }).max().unwrap()
    }
}