这个题目的解法和15. 三数之和 解法的基本框架是类似的。先sort ,再用双指针,复杂度是o(logn) + O(n2) = o(n2)。 主要区别是不需要判断重合,平且用一个int 来判断和target 的接近程度。
class Solution {
public:
int threeSumClosest(vector<int>& nums, int target) {
sort(nums.begin(), nums.end());
int start(0), end(nums.size()-1), min_num(abs(nums[0] + nums[1] + nums[2]- target));
int sum_result(nums[0] + nums[1] + nums[2]);
for(int i = 0; i < nums.size() -2; i++){
start = i + 1;
end = nums.size() - 1;
while(start < end){
int sum_tmp = nums[i] + nums[start] + nums[end];
int sum_tmp_diff = sum_tmp - target;
sum_result = min_num > abs(sum_tmp_diff)? sum_tmp:sum_result;
min_num = min_num > abs(sum_tmp_diff)? abs(sum_tmp_diff):min_num;
if(sum_tmp_diff == 0 ) return sum_tmp;
else if(sum_tmp_diff > 0) end --;
else start++;
}
}
return sum_result;
}
};