首页 > 代码库 > leecode -- 3sum Closet
leecode -- 3sum Closet
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).
class Solution { public: int threeSumClosest(vector<int> &num, int target) { sort(num.begin(),num.end()); int base = 0,left = 1,right = num.size() - 1; int minSum = num[base] + num[left] + num[right];int mindistance = abs(minSum - target); for(base = 0;base< num.size();base++) { left = base + 1; right = num.size() -1; while(left < right) { int sum = num[base] + num[left] + num[right]; int dis = sum - target ; if(dis > 0) { right--; }else if(dis <0) { left++; }else { return sum; } if(abs(dis) < mindistance) { minSum = sum; mindistance = abs(dis); } } } return minSum; } };
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。