首页 > 代码库 > 3Sum Closest
3Sum Closest
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).思路：
1 class Solution { 2 public: 3 int threeSumClosest( vector<int> &num, int target ) { 4 int delta = INT_MAX; 5 sort( num.begin(), num.end() ); 6 for( int i = (int)num.size()-1; i > 1; --i ) { 7 int s = 0, e = i-1; 8 while( s < e ) { 9 int sum = num[i] + num[s] + num[e];10 if( sum == target ) {11 return target;12 } else if( sum < target ) {13 ++s;14 } else {15 --e;16 }17 if( abs( sum-target ) < abs( delta ) ) { delta = sum - target; }18 }19 }20 return target + delta;21 }22 };
3Sum Closest
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。