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

解题思路和3Sum的思路相似。

代码如下：

class Solution {
public:
    int threeSumClosest(vector<int>& nums, int target) {
        sort(nums.begin(),nums.end());
        int len = nums.size();
        int max = 0x0fffffff;
        for(int k=0;k<len-2;k++)
        {
            int front = k+1,back = len-1;
            while(front<back)
            {
                int sum = nums[k]+nums[front]+nums[back];
                if(abs(max-target) > abs(sum-target))
                    max = sum;
                if(sum > target)
                {
                    back--;
                }
                else if(sum < target)
                {
                    front++;
                }
                else
                {
                    return target;
                }
            }
        }
        return max;
        
    }
};