leetcode16:3Sum Closest

最新推荐文章于 2020-05-20 08:38:32 发布

GODBAR

最新推荐文章于 2020-05-20 08:38:32 发布

阅读量402

点赞数

分类专栏： leetcode 文章标签：算法 leetcode

本文链接：https://blog.csdn.net/GODBAR/article/details/53438774

版权

leetcode 专栏收录该内容

20 篇文章 0 订阅

订阅专栏

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

最简单的方式就是遍历整个数组，所有三个数的组合空间，将三个数相加与target进行比较，如果相减为0，此时程序就可以返回了，因为找到相同的数，已经是最接近的了，否则就要遍历整个空间。或许还有其他加快速度的方法。。。。

package leetcode;

import java.util.Arrays;

//最直接的方法就是遍历所有可能的三个数的组合，与target进行相减求绝对值，
//如果碰到结果为0,直接返回，不再进行下一步
public class leet16 {
	
	public static void main(String[] args) {
		
		leet16 lee = new leet16();
		int[] array = {-1,2,1,4};
		int[] result = lee.threeSumClosest(array, 2);
		System.out.println(Arrays.toString(result));
	}
	
	public int[] threeSumClosest(int[] nums,int target){
		int[] result = {0,0,0,0}; 
		int div = Integer.MAX_VALUE;//div表示sum与target的差
		for(int i = 0;i < nums.length - 2;i++){//三个数进行循环
			for(int j = 0;j < nums.length;j++){//第三个数进行循环
				if(j == i || j == i+1){//第三个数的下标不能和前两个数相同
					continue;
				}
				int sum = nums[i] + nums[i+1]+nums[j];
				int temp;//临时变量保存三个数之和
				if(( temp = Math.abs(sum - target)) < div){
					div = temp;
					result[0] = nums[i];
					result[1] = nums[i+1];
					result[2] = nums[j];
					result[3] = sum;
					if(div == 0)return result;
				}
			}
		}
		return result;
	}
}