int findMinAbsSum(int* arr, int len) {
int min = INT_MAX;
for (int i = 1; i < len; ++i) {
if (abs(arr[i - 1] + arr[i]) < min) {
min = abs(arr[i - 1] + arr[i]);
nums[0] = arr[i - 1];
nums[1] = arr[i];
}
}
return min;
}
int findMinAbsSum(int* arr, int len) {
int min = INT_MAX;
for (int i = 1; i < len; ++i) {
if (abs(arr[i - 1] + arr[i]) < min) {
min = abs(arr[i - 1] + arr[i]);
nums[0] = arr[i - 1];
nums[1] = arr[i];
}
}
return min;
}