leetcode--3Sum Closest

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

weixin_30407099

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

阅读量134

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/averillzheng/p/3806313.html

本文介绍了一种算法，用于在给定整数数组中找到三个数，使其和最接近给定的目标值。通过排序和双指针技巧，算法有效地解决了问题。示例中，数组{-1,2,1}

摘要生成于 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[] num, int target) {
        int sum = 0, length = num.length;
		if(length > 0) {
			if(length <= 3) {
				for(int i = 0; i < length; ++i)
					sum += num[i];
			}
			else {
				Arrays.sort(num);
				int difference = Integer.MAX_VALUE;
				for(int i = 0; i < length; ++i) {
					int start = i + 1, end = length - 1;					
					while(start < end){
						int temp = num[i] + num[start] + num[end];
						if(temp == target) 
							return target;
						else {
							if(difference > Math.abs((target - temp))){
								sum = temp;
								difference = Math.abs((target - temp));
							}
							if(temp < target)
								++start;
							else
								--end;
						}						
					}
				}
			}
		}
		return sum;    
    }
}

转载于:https://www.cnblogs.com/averillzheng/p/3806313.html