Maximum of Absolute Value Expression LeetCode solution in C++

1
class Solution {
2
 public:
3
  int maxAbsValExpr(vector<int> &arr1, vector<int> &arr2) {
4
    int res = 0;
5
    int n = arr1.size();
6
    vector<int> v1;
7
    vector<int> v2;
8
    vector<int> v3;
9
    vector<int> v4;
10
    for (int i = 0; i < n; i++) {
11
      v1.push_back(i + arr1[i] + arr2[i]);
12
      v2.push_back(i + arr1[i] - arr2[i]);
13
      v3.push_back(i - arr1[i] + arr2[i]);
14
      v4.push_back(i - arr1[i] - arr2[i]);
15
    }
16
    res = max(res, *max_element(v1.begin(), v1.end()) - *min_element(v1.begin(), v1.end()));
17
    res = max(res, *max_element(v2.begin(), v2.end()) - *min_element(v2.begin(), v2.end()));
18
    res = max(res, *max_element(v3.begin(), v3.end()) - *min_element(v3.begin(), v3.end()));
19
    res = max(res, *max_element(v4.begin(), v4.end()) - *min_element(v4.begin(), v4.end()));
20
    return res;
21
  }
22
};