leetcode--3Sum Closest

最新推荐文章于 2023-02-22 17:17:57 发布

原创最新推荐文章于 2023-02-22 17:17:57 发布 · 508 阅读

0 ·

CC 4.0 BY-SA版权

leetcode 专栏收录该内容

177 篇文章

订阅专栏

本文介绍了一个算法问题：给定一个整数数组和一个目标值，找到数组中三个整数相加最接近目标值的和，并返回这三个数的和。文章通过示例解释了问题并提供了一个解决方案，采用双指针技术实现。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

public class Solution {
    public int threeSumClosest(int[] nums, int target) {
        int result = nums[0]+nums[1]+nums[2];
		Arrays.sort(nums);		
		for(int i=0;i<nums.length;i++){	
			int low = i+1;
			int high = nums.length-1;			
			while(low<high){
				if(Math.abs(nums[low]+nums[high]+nums[i]-target)<Math.abs(result-target)){
					result = nums[low]+nums[high]+nums[i];
				}
				if(nums[low]+nums[high]==target-nums[i]){						
					return target;
				}else if(nums[low]+nums[high]<target-nums[i]){
					low++;
				}else{
					high--;
				}				
			}			    	
		}		
		return result;
    }
}