[LeetCode] 16. 3Sum Closest
2016-07-17 00:54
471 查看
思路:
和3Sum差不多, 因为最终只要返回一个结果值, 所以更省事, 在内层循环做各种判断即可, 其他的可以看上一篇3Sum的文章.
和3Sum差不多, 因为最终只要返回一个结果值, 所以更省事, 在内层循环做各种判断即可, 其他的可以看上一篇3Sum的文章.
int threeSumClosest(vector<int>& nums, int target) {
int res;
sort(nums.begin(), nums.end());
for (int i = 0; i < nums.size(); i++) {
if (i && nums[i] == nums[i - 1]) continue;
int head = i + 1, tail = nums.size() - 1;
while (head < tail) {
int sum = nums[i] + nums[head] + nums[tail];
if (sum == target) return sum;
if (abs(sum - target) < abs(res - target)) res = sum;
if (sum < target) head++;
else tail--;
}
}
return res;
}
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- leetcode 179 Largest Number
- leetcode 24 Swap Nodes in Pairs
- leetcode 2 Add Two Numbers 方法1
- leetcode 2 Add Two Numbers 方法2
- leetcode----Longest Substring Without Repeating Characters
- [LeetCode]47 Permutations II
- [LeetCode]65 Valid Number
- [LeetCode]123 Best Time to Buy and Sell Stock III
- [LeetCode] String Reorder Distance Apart
- [LeetCode] Sliding Window Maximum
- [LeetCode] Find the k-th Smallest Element in the Union of Two Sorted Arrays
- [LeetCode] Determine If Two Rectangles Overlap
- [LeetCode] A Distance Maximizing Problem
- leetcode_linearList
- leetcode_linearList02
- 021-Merge Two Sorted Lists（合并两个排好序的单链表）;leetcode
- LeetCode[Day 1] Two Sum 题解
- LeetCode[Day 2] Median of Two Sorted Arrays 题解
- LeetCode[Day 3] Longest Substring Without... 题解
- LeetCode [Day 4] Add Two Numbers 题解