Find the minimal absolute value of a sum of two elements
Solution
#include <algorithm>int solution(vector<int> &A) { // write your code in C++11 (g++ 4.8.2) if (A.size() == 1) return abs(A[0]) * 2; sort(A.begin(), A.end(), [](int a, int b) { return abs(a) < abs(b); }); int min_sum = abs(A[0]) * 2; for (int i = 0; i < A.size() - 1; i++) { min_sum = min(min_sum, abs(A[i] + A[i + 1])); } return min_sum;}