【LeetCode】16. 最接近的三数之和

class Solution {
public:
    int threeSumClosest(vector<int>& nums, int target) {
        sort(nums.begin(),nums.end());
        int sum=0;
        int near=9999999;
        for(int i=0;i<=nums.size()-3;i++){
            int b=i+1;
            int d=nums.size()-1;
            while(b!=d){
                sum = nums[i]+nums[b]+nums[d];
                //cout<<nums[i]<<" "<<nums[b]<<" "<<nums[d]<<"　"<<sum<<endl;
                if(abs(sum-target)<abs(near-target)){
                    near = sum;
                }
                if(sum<target){
                    b++;
                }else if(sum == target){
                    return target;
                }else if(sum > target){
                    d--;
                }
            }
        }
        return near;
    }
};