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的sum，然后输出sum。这一道题和上一道3Sum有点类似，所以很多代码是沿用上次的代码

class Solution {
public:
    int threeSumClosest(vector<int>& nums, int target) {
        if(nums.size() <=2) return {};   
        sort(nums.begin(), nums.end());  
        int differ = 2147483647,sum;
        for(int i =0; i < nums.size();){  
            int start = i+1, end = nums.size()-1;  
            while(start < end){  
                if(nums[i]+nums[start]+nums[end] == target){    
                    differ = 0;
                    return target;
                 }else if(nums[i]+nums[start]+nums[end] < target){ 
                     if(target - (nums[i]+nums[start]+nums[end]) <= differ){
                         differ = target - (nums[i]+nums[start]+nums[end]);
                         sum = nums[i]+nums[start]+nums[end];
                     }
                        
                    start++;
                    
                    while((start < end) && nums[start] == nums[start-1]) start++;  
                }else{  
                    if(nums[i]+nums[start]+nums[end] - target <= differ){
                        differ = nums[i]+nums[start]+nums[end] - target;
                        sum = nums[i]+nums[start]+nums[end];
                    }
                        
                    end--;
                    
                    while((start < end) && nums[end] == nums[end+1]) end--;  
                }  
            }  
  
            i++;  
            while((i < nums.size()) && nums[i] == nums[i-1])  
                i++;  
        }  
        
        return sum;    
    }
};

大致思路也是用两个下标来表示第二和第三个数。然后当sum = target时，直接返回target，当sum ！= target时，则用differ表示|sum - target|，最后找到最小的differ，返回相应的sum。

上一篇3Sum的地址点击打开链接