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/two_sum_2.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/two_sum_2.cpp')
-rw-r--r-- | other/two_sum_2.cpp | 33 |
1 files changed, 0 insertions, 33 deletions
diff --git a/other/two_sum_2.cpp b/other/two_sum_2.cpp deleted file mode 100644 index 55741ac..0000000 --- a/other/two_sum_2.cpp +++ /dev/null @@ -1,33 +0,0 @@ -#include "leetcode.h" -#include <vector> - -class Solution { -public: - vector<int> twoSum(vector<int> &numbers, int target) { - vector<int> ans; - for (int i = 0; i < numbers.size(); i++) { - int low = 0, high = numbers.size() - 1; - while (low <= high) { - int mid = low + (high - low) / 2; - if (numbers[mid] == target - numbers[i]) { - if (mid == i) - low = mid + 1; - else - return {i + 1, mid + 1}; - } else if (numbers[mid] < target - numbers[i]) - low = mid + 1; - else - high = mid - 1; - } - } - return ans; - } -}; - -int main() { - Solution obj; - vector<int> numbers = {2, 7, 11, 15}; - int target = 9; - // expected output: 1,2 - obj.twoSum(numbers, target); -} |