[Leetcode 46] 16 3 Sum Cloest

Problem:

Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers. You may assume that each input would have exactly one solution.

    For example, given array S = {-1 2 1 -4}, and target = 1.

    The sum that is closest to the target is 2. (-1 + 2 + 1 = 2).

 

Analysis:

It's very much like 3 Sum problem. But instead having 0 as the 3 elements' sum, we have a given target as sum. And inorder to keep the cloest, we also need extra variables to keep track of the current cloest sum. What's simplified is that we can ignore the duplicate elements which are very important in 3 Sum problem.

 

Code:

class Solution {
public:
    int threeSumClosest(vector<int> &num, int target) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        sort(num.begin(), num.end());
        
        int diff = 0x7fffffff;
        int sum = 0;
        for (int n=0; n<num.size(); n++) {
            int i=n+1, j = num.size()-1;
            while (i < j) {
                int f = num[i] + num[j] + num[n];
                
                if (f == target) {
                    return f;
                } else if (f > target) {
                    if ((f-target) < diff) {
                        diff = f-target;
                        sum = f;
                    }
                    j--;
                } else if (f < target){ // f < d
                    if ((target-f) < diff) {
                        diff = target-f;
                        sum = f;
                    }
                    i++;
                }
            }
        }
        
        return sum;
        
    }
};

 

 

Attention: