class Solution { public: int threeSumClosest(vector& nums, int target) { if(nums.size()<3) return 0; vector sortedNums; copy(nums.begin(),nums.end(),back_inserter(sortedNums)); sort(sortedNums.begin(),sortedNums.end()); int ans,a,sum,diff,mindiff=INT_MAX,indexA,indexB,indexC; for(int i=0;i0 && a==sortedNums[indexA-1]) continue; indexB=i+1; indexC=sortedNums.size()-1; while(indexB