LeetCode - 3Sum Closest

题目：

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).

思路：

和3sum一样，排序之后，先确定第一个元素，然后对余下元素进行两边夹。

package sum;import java.util.Arrays;public class ThreeSumClosest {public int threeSumClosest(int[] nums, int target) {int len = nums.length;Arrays.sort(nums);int delta = nums[0] + nums[1] + nums[2] - target;for (int i = 0; i < len - 2;) {int l = i + 1;int r = len - 1;while (l < r) {int tmp = nums[i] + nums[l] + nums[r] - target;if (Math.abs(tmp) < Math.abs(delta))delta = tmp;if (tmp == 0)return target;if (tmp < 0)++l;else--r;}do { ++i; } while (i < len && nums[i] == nums[i - 1]);}return target + delta;}public static void main(String[] args) {// TODO Auto-generated method stubint[] nums = { -1, 2, 1, -4 };int target = 1;ThreeSumClosest t = new ThreeSumClosest();System.out.println(t.threeSumClosest(nums, target));}}

转载于:https://www.cnblogs.com/null00/p/5025899.html

LeetCode - 3Sum Closest相关推荐

[LeetCode] 3Sum Closest
依旧先来题目: Given an array S of n integers, find three integers in S such that the sum is closest to a g ...
[LeetCode]3Sum Closest
题目 Number: 16 Difficulty: Medium Tags: Array, Two Pointers Given an array S of n integers, find thre ...
LeetCode算法入门- 3Sum Closest -day10
LeetCode算法入门- 3Sum Closest -day10 Given an array nums of n integers and an integer target, find thre ...
LeetCode - 16. 3Sum Closest
16. 3Sum Closest Problem's Link -------------------------------------------------------------------- ...
leetcode 16 -- 3Sum Closest
3Sum Closest 题目: Given an array S of n integers, find three integers in S such that the sum is close ...
Leetcode | 3Sum
Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? Find all un ...
3Sum 3Sum Closest 4Sum
难度:3 3Sum的题意: 给出一列数,找出所有的满足条件的三个数,条件:三个数相加等于0 3Sum Closest 的题意: 给出一列数,找出三个数使得三个数相加最接近target 4Sum: 和3 ...
Leetcode 742. Closest Leaf in a Binary Tree
Leetcode 742. Closest Leaf in a Binary Tree Approach #1: Convert to Graph 把树转换为以k节点为中心的图,从k节点开始层序遍历, ...
【算法】3Sum Closest 最接近的三数之和
文章目录 3Sum Closest 最接近的三数之和问题描述: 分析代码二分双指针 Tag 3Sum Closest 最接近的三数之和问题描述: 给你一个长度为 n 的整数数组 nums 和 ...

LeetCode - 3Sum Closest

LeetCode - 3Sum Closest相关推荐

最新文章

热门文章