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/binary_search.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/binary_search.cpp')
-rw-r--r-- | other/binary_search.cpp | 27 |
1 files changed, 0 insertions, 27 deletions
diff --git a/other/binary_search.cpp b/other/binary_search.cpp deleted file mode 100644 index 478281e..0000000 --- a/other/binary_search.cpp +++ /dev/null @@ -1,27 +0,0 @@ -// 704. Binary Search -#include "leetcode.h" - -class Solution { -public: - int search(vector<int> &nums, int target) { - int n = nums.size() - 1; - int low = 0, high = n; - while (low <= high) { - int mid = low + (high - low) / 2; - if (nums[mid] == target) - return mid; - else if (nums[mid] > target) - high = mid - 1; - else - low = mid + 1; - } - return -1; - } -}; - -int main() { - Solution obj; - vector<int> nums = {-1, 0, 3, 5, 9, 12}; - printf("%d\n", obj.search(nums, 9)); // expect: 4 - printf("%d\n", obj.search(nums, 2)); // expect: -1 -} |