LeetCode(16) 3Sum Closest
来源:互联网 发布:中老年运动装淘宝网 编辑:程序博客网 时间:2024/05/20 21:58
https://sodaoo.github.io/2017/11/21/LeetCode-16/
https://sodaoo.github.io
来我的网站查看更多 LeetCode 题解
Description :
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 }, target = 1.
The sum that closest to the target is 2. ( cause: -1 + 2 + 1 = 2).
寻找 array 里面三数之和距离 target 最近的数 .返回这三数之和 .
一开始以为和前面的三数之和有关, 但是很不幸…这是另一个题了 ..
方法就是不断的维护三个数的较小值, 直到遍历结束 .
如何确保不用三重循环? 只需要对 array 排序, 然后用三个指针 ,两个指在最前, 一个指在最后 .
def threeSumClosest(self,nums,target): nums.sort() res = nums[0]+nums[1]+nums[2] # result # 两个循环 ,维护相对较小的 res for i in range(len(nums) - 2): j , k = i+1 ,len(nums)-1 while j<k: sum = nums[i]+nums[j]+nums[k] if sum == target: return sum if abs(sum - target) < abs(res - target): res = sum if sum < target : j = j + 1 elif sum > target: k = k - 1 return res
static int x=[]() { std::ios::sync_with_stdio(false); cin.tie(NULL); return 0;}();class Solution {public: int threeSumClosest(vector<int>& nums, int target) { int res = nums[0] + nums[1] + nums[2]; int diff = abs(res - target); sort(nums.begin(), nums.end()); for (int i = 0; i < nums.size() - 2; ++i) { int left = i + 1, right = nums.size() - 1; while (left < right) { int sum = nums[i] + nums[left] + nums[right]; int newDiff = abs(sum - target); if (diff > newDiff) { diff = newDiff; res = sum; } if (sum < target) ++left; else --right; } } return res; }};
Thanks for 思路来源
阅读全文
0 0
- 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
- leetcode-16 3Sum closest
- LeetCode---(16) 3 Sum Closest
- LeetCode 16 - 3Sum Closest
- leetcode 16 -- 3Sum Closest
- 3Sum Closest - LeetCode 16
- leetcode 16: 3Sum Closest
- Leetcode#16 3Sum Closest
- LeetCode(16) 3Sum Closest
- LeetCode #16 3Sum Closest
- JavaWeb-2.浏览器的缓存机制
- Hibernate与 MyBatis的比较
- Linux日志查看命令
- Apple Pay Merchant IDs配置流程与生成私钥说明文档
- 判断网络是否连接
- LeetCode(16) 3Sum Closest
- 【ng2】运行 ng serve --open 时报错
- 蚂蚁金服开源:数据驱动的高交互可视化图形语法G2
- css3配合jq的3d立体跑马灯幻灯片
- phoenix for cdh5.9 搭建以及注意点
- 实现复选框的反选功能
- Jumpserver 0.4.0 基于 CenOS7 的系统
- 自定义属性学习笔记(TypedArray)
- java基础-统计字符串在另一个字符串出现次数