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/binary_search.cpp | |
parent | 5d7cdc215e4ba1ec4cbb24c084cccb5e5e641468 (diff) | |
download | leetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.tar.gz leetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.zip |
chore: move cpp and rust code to directory
Diffstat (limited to 'other/binary_search.cpp')
-rw-r--r-- | other/binary_search.cpp | 27 |
1 files changed, 27 insertions, 0 deletions
diff --git a/other/binary_search.cpp b/other/binary_search.cpp new file mode 100644 index 0000000..478281e --- /dev/null +++ b/other/binary_search.cpp @@ -0,0 +1,27 @@ +// 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 +} |