暴力破解会超时,与上一题一样,使用双指针法,时间复杂度O(n*n)。
class Solution {
public:
int threeSumClosest(vector<int>& nums, int target) {
int result = 0;
sort(nums.begin(), nums.end());
result = nums[0] + nums[1] + nums[2];
for(int i = 0; i < nums.size(); i++)
{
int left = i+1;
int right = nums.size()-1;
while(left < right)
{
int temp = nums[i] + nums[left] + nums[right];
if(abs(target - temp)<abs(result-target))
{
result = temp;
}
if(temp == target)
{
return target;
}
else if(temp > target)
{
right--;
}
else
{
left++;
}
}
}
return result;
}
};