首页 > 代码库 > leetcode_016 3Sum Closest(TwoPointers)
leetcode_016 3Sum Closest(TwoPointers)
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).
同leetcode015
Python实现
class Solution(object): def threeSumClosest(self, nums, target): nums.sort() ans = nums[0] + nums[1] + nums[2] tsum = 0 length = len(nums) for i in range(length): left = i + 1 right = length - 1 while left < right: tsum = nums[i] + nums[left] + nums[right] if abs(tsum - target) < abs(ans -target): ans = tsum if tsum <= target: left += 1 else: right -= 1 return ans
leetcode_016 3Sum Closest(TwoPointers)
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。