[LeetCode]16. 3Sum Closest

Description:

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

——————————————————————————————————————————————————————————————————————————

Solution:

思路和3 Sum是一样的，但是在这里要注意的是不能刻意跳过重复元素！因为有可能最优解就是由重复元素组成的，如输入数组为[-1,0,1,1,55]，target为3，如果跳过重复元素[1]，那么得到的最优解是0（-1+0+1），然而实际上最优解是2（0+1+1）。

class Solution {
public:
    int threeSumClosest(vector<int>& nums, int target) {
        sort(nums.begin(), nums.end());
        
        int closest = nums[0] + nums[1] + nums[2];
        
        for (int i = 0; i < nums.size() - 2; i++) {
            int left = i + 1, right = nums.size() - 1;
            while (left < right) {
                
                if (abs(closest - target) > abs(nums[left] + nums[right] + nums[i] - target)) {
                    closest = nums[left] + nums[right] + nums[i];
                }
                // skip duplication
                // while (left < nums.size() - 2 && nums[left] == nums[left + 1]) left++;
                // while (right > 1 && nums[right] == nums[right - 1]) right--;
                
                if (abs(nums[left + 1] + nums[right] + nums[i] - target) < abs(nums[left] + nums[right - 1] + nums[i] - target)) {
                    left++;
                } else {
                    right--;
                }
            }
        }
        
        return closest;
    }
};