leetcode-16-3sum closest
来源:互联网 发布:图灵系列图书 知乎 编辑:程序博客网 时间:2024/05/29 17:14
题目:给一个list,一个target。找list中3个数相加最接近target的值。
class Solution(object): def threeSumClosest(self, nums, target): """ :type nums: List[int] :type target: int :rtype: int """ nums.sort() m=len(nums) a=[] minwater=nums[0]+nums[1]+nums[2] for i in range(m-2): j=i+1 k=m-1 while(j<k): water=(nums[i]+nums[j]+nums[k]) if abs(target-water)<=abs(target-minwater): minwater=water if minwater==target: return target if water>target: k-=1 else: j+=1 return minwater
根据3sum 改进,遍历的思路是一样的。改动一个判断来寻找最接近target的值。Accepted。
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
- HDU 1914 The Stable Marriage Problem 稳定婚姻关系
- c++ 覆盖、重载与隐藏 浅析
- php 分页类
- Twitter是如何做到每秒处理3000张图片的?
- CentOS 6.5 NVIDIA Tesla C2050配置OpenCL
- leetcode-16-3sum closest
- Android智能指针 (sp & wp)
- MyEclipse部署到tomcat上的项目名不是我更改后的项目名怎么解决
- angularJS directive详解
- RCNN学习笔记(7):Faster R-CNN 英文论文翻译笔记
- uvalive4987
- 怎样找到项目打包后的文件
- Leetcode 258 Add Digits
- const 指针与指针指向的内容为const