解法一：
?

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

?

總結(jié)

以上是生活随笔為你收集整理的Leetcode 16. 最接近的三数之和(3Sum Closest)的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯，歡迎將生活随笔推薦給好友。