python写算法题:leetcode: 16. 3Sum Closest
来源:互联网 发布:网络赚钱项目 编辑:程序博客网 时间:2024/04/27 17:06
https://leetcode.com/problems/3sum-closest/#/description
class Solution(object): def match(self, nums, ind0, target, res): ind1=ind0+1 ind2=len(nums)-1 minv=abs(target-res) while ind1<len(nums)-1 and ind2>ind1: if nums[ind1]+nums[ind2]>target-nums[ind0]: if nums[ind1]+nums[ind2]+nums[ind0]-target<minv: res = nums[ind1]+nums[ind2]+nums[ind0] minv=res-target while ind1<ind2-1 and nums[ind2]==nums[ind2-1]: ind2-=1 ind2-=1 else: if nums[ind1]+nums[ind2]==target-nums[ind0]: return target else: if target-nums[ind1]-nums[ind2]-nums[ind0]<minv: res = nums[ind1]+nums[ind2]+nums[ind0] minv=target-res while ind1<len(nums)-1 and nums[ind1]==nums[ind1+1]: ind1+=1 ind1+=1 return res def threeSumClosest(self, nums, target): if len(nums)<3: return 0 nums.sort() ind0=0 res = nums[0]+nums[1]+nums[2] while ind0<len(nums)-2: res = self.match(nums, ind0, target, res) if res==target: return target while ind0<len(nums)-1 and nums[ind0]==nums[ind0+1]: ind0+=1 ind0+=1 return res
阅读全文
0 0
- python写算法题:leetcode: 16. 3Sum Closest
- 16. 3Sum Closest Leetcode Python
- [leetcode: Python]16. 3Sum Closest
- LeetCode算法题——16. 3Sum Closest
- 【Leetcode】【python】3Sum Closest
- leetcode 3 sum 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. 3Sum Closest
- LeetCode 16. 3Sum Closest
- LeetCode *** 16. 3Sum Closest
- Linux内核OOM机制的详细分析
- 表单标签的简介
- 《Java编程思想》第四版之内部类学习——神奇而又实用
- 名企笔试:网易游戏2017招聘笔试题(消除重复元素)
- ARKit从入门到精通(4)-ARKit全框架API大全
- python写算法题:leetcode: 16. 3Sum Closest
- js小知识
- ARKit从入门到精通(5)-ARScnView介绍
- android中AsyncTask源码解析
- 简单理解PHP的面向对象编程方式
- ARKit从入门到精通(6)-ARSession介绍
- 卡尔曼滤波器优秀博文链接
- Excel应用-使用VBA自动绘制所有适用类型的Excel图表(代码及效果图)
- Giraph消息发送结构刨析