Leetcode--16. 3Sum Closest
2017-04-11 20:35
423 查看
题目: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).
思路如下:对数组排序。
对i从0到length-2:
left = i+1, right = length -1;
当left < right时:
计算sum = array[i] + array[left] + array[right];
计算diff = |target - sum|;
如果diff < mindiff, 更新mindiff,记录closest为sum
如果sum < target,left右移
否则right左移。
返回closest。
C++代码如下:
int threeSumClosest(vector<int>& nums, int target) { int len = nums.size(); int sum = 0, closest = 0, mindiff = INT_MAX, diff = INT_MAX; sort(nums.begin(), nums.end()); for (int i = 0; i < len - 2; i++) { int left = i + 1, right = len - 1; while (left < right) { sum = nums[i] + nums[left] + nums[right]; diff = abs(sum - target); if (diff < mindiff) { mindiff = diff; closest = sum; } if (sum < target) left++; else right--; } } return closest; }
相关文章推荐
- leetcode--16. 3Sum Closest
- LeetCode16 3Sum Closest
- [LeetCode16]3Sum Closest
- LeetCode 16 - 3Sum Closest
- leetcode——16——3Sum Closest
- leetcode解题之 16. 3Sum Closest Java版(结果离目标值最近三个数字和)
- leetcode_16题——3Sum Closest(两个指针)
- leetcode 16 -- 3Sum Closest
- LeetCode 16: 3Sum Closest
- LeetCode 16_3Sum Closest
- leetcode[16]3Sum Closest
- leetcode ----16. 3Sum Closest
- [LeetCode] 16. 3Sum Closest
- Leetcode 16 3Sum Closest
- LeetCode(16)3Sum Closest
- python写算法题:leetcode: 16. 3Sum Closest
- leetcode note--leetcode 16 3Sum Closest
- LeetCode_OJ【16】3Sum Closest
- LeetCode 16 3Sum Closest
- 【小熊刷题】3Sum Closest <Leetcode 16, Java>