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/find_first_last_array.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/find_first_last_array.cpp')
-rw-r--r-- | other/find_first_last_array.cpp | 22 |
1 files changed, 0 insertions, 22 deletions
diff --git a/other/find_first_last_array.cpp b/other/find_first_last_array.cpp deleted file mode 100644 index 7f5f989..0000000 --- a/other/find_first_last_array.cpp +++ /dev/null @@ -1,22 +0,0 @@ -#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; - } -}; |