题目
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).
分析
设置一个cloest比较绝对值即可,但是自己写的runtime没有达到最少。
class Solution {
public:
int threeSumClosest(vector<int>& nums, int target) {
int n=nums.size();
if(n<3) return 0;
sort(nums.begin(),nums.end());
int cloest=nums[0]+nums[1]+nums[2];
for(int i=0;i<n-2;i++){
int left=i+1,right=n-1;
while(left<right){
int sum=nums[i]+nums[left]+nums[right];
if(abs(target-cloest)>abs(target-sum)) cloest=sum;
if(sum<target) left++;
else if(sum>target) right--;
else return sum;
}
}
return cloest;
}
};