题目:
Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers. You may assume that each input would have exactly one solution.
For example, given array S = {-1 2 1 -4}, and target = 1. The sum that is closest to the target is 2. (-1 + 2 + 1 = 2).题意:
从给定的数组中找出所有三个数相加的和与给定的target最接近。返回最接近的三个数之和。
思路:
与3Sum题目类似,先排序,之后再夹逼。
代码:
C++版:
class Solution { public: int threeSumClosest(vector<int>& nums, int target) { int result = 0; int curMin = INT_MAX; sort(nums.begin(), nums.end()); for(int i=0; i<nums.size()-2; i++){ int j = i+1; int k = nums.size()-1; while(j<k){ const int sum = nums[i]+nums[j]+nums[k]; const int gap = abs(sum - target); if(gap < curMin){ result = sum; curMin = gap; } if(sum < target){ j++; }else{ k--; } } } return result; } };