从零开始的CPP（28）——双指针+条件判断

leetcode16

给你一个长度为 n 的整数数组 nums 和 一个目标值 target。请你从 nums 中选出三个整数，使它们的和与 target 最接近。

返回这三个数的和。

假定每组输入只存在恰好一个解。

示例 1：

输入：nums = [-1,2,1,-4], target = 1
输出：2
解释：与 target 最接近的和是 2 (-1 + 2 + 1 = 2) 。

示例 2：

输入：nums = [0,0,0], target = 1
输出：0

在操控双指针不断逼近target的同时，也要打擂台，记录最优的sum 

class Solution {
public:
    int threeSumClosest(vector<int>& nums, int target) {
        sort(nums.begin(), nums.end());
        for (auto pair : nums) {
            cout << pair <<" ";
        }
        cout << endl;
        int min = 9999999;
        int sum = 0;
        for (int i = 1; i < nums.size() - 1; i++) {
            int l = 0;
            int r = nums.size() - 1;
            
            while (r > l) {               
                if (nums[l] + nums[r] + nums[i] < target) {
                    if (abs(nums[l] + nums[r] + nums[i] - target) < min) {
                        min = abs(nums[l] + nums[r] + nums[i] - target);
                        sum = nums[l] + nums[r] + nums[i];
                        if (l + 1 == i) {
                            break;
                        }
                        l++;
                    }
                    else {
                        if (l + 1 == i) {
                            break;
                        }
                        l++;
                    }
                    
                }    
                else if (nums[l] + nums[r] + nums[i] > target) {
                    
                    if (abs(nums[l] + nums[r] + nums[i] - target) < min) {
                        min = abs(nums[l] + nums[r] + nums[i] - target);
                        sum = nums[l] + nums[r] + nums[i];
                        if (r - 1 == i) {
                            break;
                        }
                        r--;
                    }
                    else {
                        if (r -1 == i) {
                            break;
                        }
                        r--;
                    }
                }
                else if (nums[l] + nums[r] + nums[i] - target == 0) {
                    return nums[l] + nums[r] + nums[i];
                }               
            } 
            
        }
        
        return sum;
    }
};
int main()
{
    Solution solution;   
    vector<int> nums = { -1000,-1000,-1000 };
    //vector<int> nums = { -43,57,-71,47,3,30,-85,6,60,-59,0,-46,-40,-73,53,68,-82,-54,88,73,20,-89,-22,39,55,-26,95,-87,-57,-86,28,-37,43,-27,-24,-88,-35,82,-3,39,-85,-46,37,45,-24,35,-49,-27,-96,89,87,-62,85,-44,64,78,14,59,-55,-10,0,98,50,-75,11,97,-72,85,-68,-76,44,-12,76,76,8,-75,-64,-57,29,-24,27,-3,-45,-87,48,10,-13,17,94,-85,11,-42,-98,89,97,-66,66,88,-89,90,-68,-62,-21,2,37,-15,-13,-24,-23,3,-58,-9,-71,0,37,-28,22,52,-34,24,-8,-20,29,-98,55,4,36,-3,-9,98,-26,17,82,23,56,54,53,51,-50,0,-15,-50,84,-90,90,72,-46,-96,-56,-76,-32,-8,-69,-32,-41,-56,69,-40,-25,-44,49,-62,36,-55,41,36,-60,90,37,13,87,66,-40,40,-35,-11,31,-45,-62,92,96,8,-4,-50,87,-17,-64,95,-89,68,-51,-40,-85,15,50,-15,0,-67,-55,45,11,-80,-45,-10,-8,90,-23,-41,80,19,29,7 };
    int target = 0;
    int res = solution.threeSumClosest(nums,target);
    cout << res << endl;
    return 0;
}