LeetCode 016 3Sum Closest

class Solution {
public:
int threeSumClosest(vector<int>& nums, int target) {
vector<vector<int> >w;
vector<int>temp;
int min1=(1<<30);
int min2=(1<<30);
sort(nums.begin(),nums.end());
for(int ii=0;ii<nums.size();ii++){
int l=ii+1;
int target1=target-nums[ii];
int r=nums.size()-1;
while(l<r){
int ss=(nums[ii]+nums[l]+nums[r]);
if(target1==nums[l]+nums[r])return target;
else if(nums[l]+nums[r]<target1){min1=min1<(target-ss)?min1:(target-ss);l++;}
else {
min2=min2<(ss-target)?min2:(ss-target);r--;
}
}
}
return min1<min2?target-min1:target+min2;
}
};