diff options
author | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
---|---|---|
committer | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
commit | a96b65cbfad7f62f3db6b2eab105e4e25c0414c5 (patch) | |
tree | e2a2b3f49f9fb741be81415266ac93e74cff42ec /other/3sum_closest.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/3sum_closest.cpp')
-rw-r--r-- | other/3sum_closest.cpp | 31 |
1 files changed, 0 insertions, 31 deletions
diff --git a/other/3sum_closest.cpp b/other/3sum_closest.cpp deleted file mode 100644 index 3050ee0..0000000 --- a/other/3sum_closest.cpp +++ /dev/null @@ -1,31 +0,0 @@ -#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); -} |