class Solution {
public:
int threeSumClosest(vector<int> &num, int target) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
sort(num.begin(), num.end());
int res = 0;
int diff = INT_MAX;
for (int i = 0; i < num.size(); ++i)
{
int j = i + 1;
int k = num.size() - 1;
int tempSum = 0;
while (j < k)
{
tempSum = num[i] + num[j] + num[k];
if (tempSum == target)
return target;
else if (tempSum > target)
{
if (diff > tempSum - target)
{
diff = tempSum - target;
res = tempSum;
}
k--;
}
else if (tempSum < target)
{
if (diff > target - tempSum)
{
diff = target - tempSum;
res = tempSum;
}
j++;
}
}
}
return res;
}
};
[Leetcode] 3Sum Closest
最新推荐文章于 2020-01-16 15:31:01 发布