3Sum Closest

最新推荐文章于 2020-09-08 11:56:16 发布

原创最新推荐文章于 2020-09-08 11:56:16 发布 · 568 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#算法 #LeetCode

LeetCode 专栏收录该内容

67 篇文章

订阅专栏

本文介绍了一个算法问题：给定一个整数数组和一个目标值，找到数组中三个整数使得它们的和最接近目标值，并返回这个和。通过排序和双指针技巧实现高效求解。

摘要生成于 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).

排序后固定一个数，两边夹逼另外两个数

class Solution {
public:
    int threeSumClosest(vector<int> &num, int target) {
        int gap=INT_MAX;
        sort(num.begin(),num.end());
        for(int i=0;i<num.size();i++){
            int j=i+1,k=num.size()-1;
            while(j<k){
                int sum=num[i]+num[j]+num[k];
                if(abs(sum-target)<abs(gap)) gap=sum-target;
                if(sum-target>0) k--;
                else if(sum-target<0) j++;
                else return gap+target;
            }
        }
        return gap+target;
    }
};