diff options
author | Jack Sangdahl <[email protected]> | 2025-03-10 00:36:13 -0600 |
---|---|---|
committer | Jack Sangdahl <[email protected]> | 2025-03-10 00:36:13 -0600 |
commit | 7c60dee83b436e8e8a667bf9f191beced8de4fc3 (patch) | |
tree | eb7a24ee2067f92245c57bb118e85a1baf15df50 /other/3sum_closest.cpp | |
parent | 5d7cdc215e4ba1ec4cbb24c084cccb5e5e641468 (diff) | |
download | leetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.tar.gz leetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.zip |
chore: move cpp and rust code to directory
Diffstat (limited to 'other/3sum_closest.cpp')
-rw-r--r-- | other/3sum_closest.cpp | 31 |
1 files changed, 31 insertions, 0 deletions
diff --git a/other/3sum_closest.cpp b/other/3sum_closest.cpp new file mode 100644 index 0000000..3050ee0 --- /dev/null +++ b/other/3sum_closest.cpp @@ -0,0 +1,31 @@ +#include "leetcode.h" + +class Solution { +public: + int threeSumClosest(vector<int> &nums, int target) { + sort(nums.begin(), nums.end()); + int n = nums.size(), ans = nums[0] + nums[1] + nums[2]; + for (int i = 0; i < n - 2; ++i) { + int left = i + 1, right = n - 1; + while (left < right) { + int sum3 = nums[i] + nums[left] + nums[right]; + if (abs(ans - target) > abs(sum3 - target)) + ans = sum3; + if (sum3 == target) + break; + if (sum3 > target) + --right; + else + ++left; + } + } + return ans; + } +}; + +int main() { + Solution obj; + vector<int> nums = {-1, 2, 1, -4}; + int target = 1; + cout << obj.threeSumClosest(nums, target); +} |