-
Notifications
You must be signed in to change notification settings - Fork 22
Expand file tree
/
Copy path16.3sum-closest.cpp
More file actions
59 lines (55 loc) · 1.5 KB
/
16.3sum-closest.cpp
File metadata and controls
59 lines (55 loc) · 1.5 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
// Tag: Array, Two Pointers, Sorting
// Time: O(N^2)
// Space: O(1)
// Ref: -
// Note: -
// Given an integer array nums of length n and an integer target, find three integers in nums such that the sum is closest to target.
// Return the sum of the three integers.
// You may assume that each input would have exactly one solution.
//
// Example 1:
//
// Input: nums = [-1,2,1,-4], target = 1
// Output: 2
// Explanation: The sum that is closest to the target is 2. (-1 + 2 + 1 = 2).
//
// Example 2:
//
// Input: nums = [0,0,0], target = 1
// Output: 0
// Explanation: The sum that is closest to the target is 0. (0 + 0 + 0 = 0).
//
//
// Constraints:
//
// 3 <= nums.length <= 500
// -1000 <= nums[i] <= 1000
// -104 <= target <= 104
//
//
class Solution {
public:
int threeSumClosest(vector<int>& nums, int target) {
int n = nums.size();
int result = nums[0] + nums[1] + nums[2];
sort(nums.begin(), nums.end());
for (int k = 2; k < n; k++) {
int l = 0;
int r = k - 1;
while (l < r) {
int tmp = nums[l] + nums[r] + nums[k];
if (abs(target - result) > abs(target - tmp)) {
result = tmp;
}
if (tmp == target) {
break;
} else if(tmp > target){
r -= 1;
} else {
l += 1;
}
}
}
return result;
}
};