OJ练习49——T16 3Sum Closest

int threeSumClosest(vector<int>& num, int target) {
        int result=0;
        int sub=INT_MAX;
        int n=num.size();
        sort(num.begin(),num.end());
        for(int i=0; i<n; i++)
        {
            int j=i+1, k=n-1;
            while(j<k){
                int cur=num[i]+num[j]+num[k];
                if(cur<target){
                    j++;
                    if(target-cur<sub){
                        sub=target-cur;
                        result=cur;
                    }
                }
                else if(cur>target){
                    k--;
                    if(cur-target<sub){
                        sub=cur-target;
                        result=cur;
                    }
                }
                else{
                    sub=0;
                    result=cur;
                    break;
                }
            }
        }
        return result;
    }