aboutsummaryrefslogtreecommitdiff
path: root/other/find_first_last_array.cpp
diff options
context:
space:
mode:
authorJack Sangdahl <[email protected]>2025-03-10 00:36:13 -0600
committerJack Sangdahl <[email protected]>2025-03-10 00:36:13 -0600
commit7c60dee83b436e8e8a667bf9f191beced8de4fc3 (patch)
treeeb7a24ee2067f92245c57bb118e85a1baf15df50 /other/find_first_last_array.cpp
parent5d7cdc215e4ba1ec4cbb24c084cccb5e5e641468 (diff)
downloadleetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.tar.gz
leetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.zip
chore: move cpp and rust code to directory
Diffstat (limited to 'other/find_first_last_array.cpp')
-rw-r--r--other/find_first_last_array.cpp22
1 files changed, 22 insertions, 0 deletions
diff --git a/other/find_first_last_array.cpp b/other/find_first_last_array.cpp
new file mode 100644
index 0000000..7f5f989
--- /dev/null
+++ b/other/find_first_last_array.cpp
@@ -0,0 +1,22 @@
+#include "leetcode.h"
+
+class Solution {
+public:
+ vector<int> searchRange(vector<int> &nums, int target) {
+ int tLeft = find(target, nums);
+ if (tLeft == nums.size() || nums[tLeft] != target)
+ return {-1, -1};
+ return {tLeft, find(target + 1, nums, tLeft) - 1};
+ }
+ int find(int target, vector<int> arr, int left = 0) {
+ int right = arr.size() - 1;
+ while (left <= right) {
+ int mid = left + right >> 1;
+ if (arr[mid] < target)
+ left = mid + 1;
+ else
+ right = mid - 1;
+ }
+ return left;
+ }
+};