3Sum Closest

class Solution {public:    int threeSumClosest(vector<int>& nums, int target)     {        int size=nums.size();        sort(nums.begin(),nums.end());        int mindiff=INT_MAX;        int result;        for(int i=0;i<size;++i)        {            int index1=i+1;            int index2=size-1;            while(index1<index2)            {                int sum=nums[i]+nums[index1]+nums[index2];                if(sum==target)                    return sum;                else if(sum>target)                    --index2;                else                    ++index1;                if(abs(target-sum)<mindiff)                {                    result=sum;                    mindiff=abs(target-sum);                }               }        }        return result;            }};