题目地址:3Sum Closest
描述:
Given an array nums of n integers and an integer target, find three integers in nums such that the sum is closest to target. Return the sum of the three integers. You may assume that each input would have exactly one solution.–摘自《领扣》
Example 2:
Given array nums = [-1, 2, 1, -4], and target = 1.
The sum that is closest to the target is 2. (-1 + 2 + 1 = 2).
import java.lang.reflect.Array;
import java.util.Arrays;
import java.util.HashSet;
import java.util.List;
import java.util.Set;
public class ThressNumsClosest {
public static void main(String[] args) {
int[] arr = {1,3,4,-10,2,-4,-9,6};
int target =7;
int res= threeNums(arr, target);
System.out.println(res);
}
//0=a+b+c
private static int threeNums(int[] arr,int target){
int temp =arr[0]+arr[1]+arr[2];
int abs = Math.abs(temp - target);
for (int i = 0; i< arr.length; i++) {
for (int j = i+1; j < arr.length; j++) {
int sum = arr[i]+arr[j];
int k =j+1;
while(k<arr.length){
temp = Math.abs(sum+arr[k]-target);
if (temp==0) {
return 0;
}
if (temp<abs) {
abs = temp;
}
k++;
}
}
}
return abs;
}
//分而治之
private static int threeNumsTwo(int[] arr,int target){
//首先是排序
Arrays.sort(arr);
int len = arr.length;
// 设置默认值
int temp =Math.abs(arr[0]+arr[1]+arr[len-1]-target);
int end=len-1;
for (int i = 0; i< arr.length; i++) {
int start =i+1;
while(start<end){
int re =arr[i] +arr[start]+ arr[end];
int abs1 = Math.abs(re-target);
//题干中说只有一个,所以如果存在就直接返回。
if (abs1 == 0) {
return abs1;
}
if (abs1 < temp ) {
temp =abs1;
}
if (re<target) {
start ++;
}else{
end --;
}
}
}
return temp;
}
}