[LeetCode] 3Sum Closest

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).

找三个数，使其和最接近target ,与3Sum类似，对数组排序后，先确定前两个数，第三个数可以二分查找。

class Solution {
public:
    int threeSumClosest(vector<int> &num, int target) {
        // Note: The Solution object is instantiated only once and is reused by each test case.
        int diff = INT_MAX;
        int ret = 0;
        sort(num.begin(),num.end());
        for(int i = 0; i < num.size(); i++) {
            for(int j = i+1; j < num.size(); j++) {
                int kStart = j+1, kEnd = num.size()-1;
                if(kStart > kEnd) break;
                while(kStart <= kEnd) {
                    int kMid = kStart + (kEnd-kStart)/2;
                    if(num[kMid]+num[i]+num[j] == target) return target;
                    int tmpDiff = abs(num[kMid]+num[i]+num[j]-target);
                    if(diff > tmpDiff) {
                        diff = tmpDiff;
                        ret = num[kMid]+num[i]+num[j];
                    }
                    if(num[kMid]+num[i]+num[j] > target) kEnd = kMid-1;
                    else kStart = kMid+1;
                }
            }
        }
        return ret;
    }
};