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

【代码】

<pre name="code" class="cpp">class Solution {
public:

    void quickSort(vector<int> &num,int low,int high){
        if(low>=high) return;
        int pivot=num[high],i=low,j=high;
        while(i<j){
            while((i<j)&&(num[i]<=pivot)) ++i;
            num[j]=num[i];
            while((i<j)&&(num[j]>=pivot)) --j;
            num[i]=num[j];
        }
        num[i]=pivot;
        quickSort(num,low,i-1);
        quickSort(num,i+1,high);
    }
    
    int threeSumClosest(vector<int> &num, int target) {
        quickSort(num,0,num.size()-1);
        int closeSum=0x3f3f3f3f,i,j,k;
        for(i=0;i<num.size();++i){
            j=i+1;
            k=num.size()-1;
            while(j<k){
                int sum=num[i]+num[j]+num[k];
                if(abs(target-closeSum)>abs(target-sum)) closeSum=sum;
                if(sum==target) return target;
                else if(sum<target) ++j;
                else --k;
            }
        }
        return closeSum;
    }
};

【总结】
1.思路：题目的意思是找出最接近target的和值，首先对数组进行快速排序，然后顺序扫描数组，对每个数字，在其后面的数字中找两个数使三个数和值与target差的绝对值最小，可以采用首尾两个指针找这两个数。