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.
example
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).
题目理解:输入一个数组和一个目标值,求数组中三个数的和,返回和与目标值之间的最小差值。
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
publicclass{
publicintthreeSumClosest(int[] nums, int target){
int dis = Integer.MAX_VALUE, result = -1, m = nums.length;
Arrays.sort(nums);
for ( int i = 0, bound = m - 2 ; i < bound && dis != 0 && nums[i] - target < dis; ) {
近期评论