//先排序 然后再双指针逼近
//先决条件right>left>i
class Solution {
public:
int threeSumClosest(vector<int>& nums, int target) {
int x,twosum,left = 1,right = nums.size()-1,ans;
sort(nums.begin(), nums.end());
for (int i = 0; i < nums.size() && right>left && left > i; i++) {
x = target - nums[i];
left = i + 1, right = nums.size() - 1;
while (left < right - 1) {//将三个数转换为两个数之和
twosum = nums[left] + nums[right];
if (twosum > x)
right--;
else if (twosum < x)
left++;
else
return target;
}
if (i == 0)
ans = nums[left] + nums[right] + nums[i];
else if (i > 0 && abs(nums[left] + nums[right] + nums[i] - target) < abs(target - ans))
ans = nums[left] + nums[right] + nums[i];
}
return ans;
}
};
LeetCode 16. 最接近的三数之和
最新推荐文章于 2024-09-14 20:30:05 发布