C++之求取vector中三个元素和和给定元素最接近的值（15）---《那些奇怪的算法》

参考：《one-day-one-leetcode》
问题描述：给定一个向量vec，求取vec中三个数组的和与给定元素target最接近，输出该值！

我们对于这种问题有两种思路，一种是直接利用暴力算法求解，通过三重循环一直让其不断寻找，直至找到和查找值最接近的值；第二种方式是利用智能方法求解，不断地将值所能取得的范围缩小，然后逐步求解，但是这里需要注意注意i->i+1的变换，需要保持key不变！

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>

using namespace std;
int threeNumSumClosestOne(vector<int>& nums, int target){
    int min = 123123123;
    int key = 0;
    sort(nums.begin(), nums.end());
    for (int i = 0; i < nums.size() - 2;){
        for (int j = i + 1; j < nums.size() - 1;){
            for (int k = j + 1; k < nums.size();){
                int sum = nums[i] + nums[j] + nums[k];
                int gap = sum - target>0 ? sum - target : target - sum;
                if (gap < min){
                    min = gap;
                    key = sum;
                    if (min == 0){
                        return key;
                    }
                }
                k++;
                while (k < nums.size() && nums[k] == nums[k - 1]) k++;
            }
            j++;
            while (j < nums.size()-1 && nums[j] == nums[j - 1]) j++;
        }
        i++;
        while (i < nums.size()-2 && nums[i] == nums[i - 1]) i++;
    }
    return key;
}
int threeNumSumCloseOne_simple(vector<int>& nums, int target){
    sort(nums.begin(), nums.end());
    int key = 0;
    for (int i = 0; i < nums.size(); i++){
        int j = i + 1;
        int k = nums.size() - 1;
        bool isFirst = true;
        while (j < k){
            int sum = nums[i] + nums[j] + nums[k];
            if (isFirst==true&&i==0){
                key = sum;
                isFirst = false;
            }
            else{
                if (abs(sum - target) < abs(key - target)){
                    key = sum;
                }
            }
            if (key == target) return key;
            else if (key > target) {
                k--;
                while (j < k&&nums[k] == nums[k + 1]) k--;
            }
            else{
                j++;
                while (j < k&&nums[j] == nums[j - 1]) j++;
            }
        }
    }
    return key;
}
int threeNumSumCloseOne_simple02(vector<int>& nums, int target){
    int key = 0;
    sort(nums.begin(), nums.end());
    bool isFirst = true;
    for (int i = 0; i < nums.size(); i++){
        int j = i + 1;
        int k = nums.size() - 1;
        while (j < k){
            int sum = nums[i] + nums[j] + nums[k];
            if (isFirst){
                key = sum;
                isFirst = false;
            }
            else{
                if (abs(sum - target) < abs(key - target)){
                    key = sum;
                }
            }
            if (key == target) return key;
            else if (key > target) {
                k--;
                while (k > j&&nums[k] == nums[k + 1]) k--;
            }
            else{
                j++;
                while (j < k&&nums[j] == nums[j - 1]) j++;
            }
        }
    }
    return key;
}

int main(){
    int a[] = { -1,2,1,-4};
    vector<int> vec;
    for (int i = 0; i < sizeof(a) / sizeof(a[0]); i++){
        vec.push_back(a[i]);
    }
    int i = threeNumSumCloseOne_simple(vec, 2);
    cout << i << endl;
    return 0;
}

运行结果：