问题
思路
注意,夹逼的思路一定要注意,必须要排序!!!否则,就是错的。
夹逼其实也相当于某种程度的遍历,但是它的技巧性很强。关键就是在排序,最近收获的这个方法非常赞啊!引入一个new_diff保留最小差值即可。
代码
class Solution {
public:
int threeSumClosest(vector<int>& nums, int target) {
int sz = nums.size();
int diff = INT_MAX;
sort(nums.begin(), nums.end());
int ans = -1;
for(int i = 0; i < sz-2; ++i) {
int j = i + 1;
int k = sz-1;
while(j < k) {
int t = nums[i] + nums[j] + nums[k];
int new_diff = abs(t - target);
if( new_diff < diff ) {
diff = new_diff;
ans = t;
}
if( t < target ) ++j;
else --k;
}
}
return ans;
}
};