16.jpeg

    代码 :

    1. class Solution {
    2. public:
    3.     typedef pair<int, int> PII;
    4.     int threeSumClosest(vector<int>& nums, int target) {
    5.         if(nums.size() < 3) return 0;
    7.         sort(nums.begin(), nums.end());
    8.         int gap = INT_MAX, res = 0;
    10.         for(int i = 0; i < nums.size(); i ++ ) {
    11.             for(int j = i + 1, k = nums.size() - 1; j < k; ) {
    12.                 int sum = nums[i] + nums[j] + nums[k];
    13.                 if(abs(sum - target) < gap) res = sum, gap = abs(sum - target);
    15.                 if(sum == target) return sum; 
    16.                 else if (sum < target) j ++;
    17.                 else k --;
    19.             }
    20.         }
    22.         return res; 
    23.     }
    24. };