leetcode第16题——2Sum Cloest

问题描述
Given an array nums of n integers and an integer target, find three integers in nums such that the sum is closest to target. Return the sum of the three integers. You may assume that each input would have exactly one solution.

Example:

Given array nums = [-1, 2, 1, -4], and target = 1.

The sum that is closest to the target is 2. (-1 + 2 + 1 = 2).

解法思路
类似于15题的3Sum，采取同样的循环结构，关键在于j和k的变化情况有所改变，优化目标变为减小temp的绝对值

C++代码

class Solution {
public:
    int threeSumClosest(vector<int>& nums, int target) {
        sort(nums.begin(),nums.end());
        int n=nums.size();
        int d=target-nums[0]-nums[1]-nums[2];
        int res=nums[0]+nums[1]+nums[2];//初始化结果
        if(n==3) return res;
        for(int i=0;i<nums.size()-2;++i)
        {
            int j=i+1;
            int k=nums.size()-1;
            while(j<k)
            {
                int temp=target-nums[i]-nums[j]-nums[k];
                if(abs(d)>abs(temp))
                {
                    d=temp;
                    res=nums[i]+nums[j]+nums[k];
                }
                //确定j,k的变化情况，使得temp的绝对值始终在减小
                if(temp>0) ++j;
                if(temp<0) --k;
                if(temp==0) return res;
               
            }
        }
        return res;
    
        
    }
};

结果分析
Runtime: 8 ms, faster than 100.00% of C++ online submissions for 3Sum Closest.
Memory Usage: 8.7 MB, less than 99.72% of C++ online submissions for 3Sum Closest.