leetcode

0 class Solution {

1 public:

2 int threeSumClosest(vector<int> &nums, int target) {

3 int n = nums.size(), delta = INT_MAX / 2, res = 0;

4 sort(nums.begin(), nums.end());

5 for (int i = 0; i < n; i++) {

6 int j = i + 1;

7 int k = n - 1;

8 while (j < k) {

9 int sum = nums[i] + nums[j] + nums[k];

10 if (abs(target - sum) < delta) {

11 delta = abs(target - sum);

12 res = sum;

13 }

14 (sum > target) ? k-- : j++;

15 }

16 }

17 return res;

18 }

19 };