IEEE CodeBuddy | Week 3 | Ashwin Joisa & Akash Nair

3sum.cpp

int Solution::threeSumClosest(vector<int> &A, int B) {
    int ans = INT_MIN/2;
    int n = A.size();
    sort(A.begin(),A.end());
    int i, j, k;
    for(int i = 0; i < n; i++){
        j = i + 1;
        k = n - 1;
        while(j < k){
            if(abs(B - (A[i]+A[j]+A[k])) < abs(B - ans))
                ans = A[i] + A[j] + A[k];
            if(A[j] + A[k] <= (B - A[i])){
                j++;    
            }
            else k--;
        }
    } 
    return ans;
}