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/peak_idx_mountain_arr.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/peak_idx_mountain_arr.cpp')
-rw-r--r-- | other/peak_idx_mountain_arr.cpp | 25 |
1 files changed, 0 insertions, 25 deletions
diff --git a/other/peak_idx_mountain_arr.cpp b/other/peak_idx_mountain_arr.cpp deleted file mode 100644 index 2900091..0000000 --- a/other/peak_idx_mountain_arr.cpp +++ /dev/null @@ -1,25 +0,0 @@ -// 852. Peak Index in a Mountain Array -#include "leetcode.h" - -class Solution { -public: - int peakIndexInMountainArray(vector<int> &arr) { - int left = 1, right = arr.size() - 1; - while (left < right) { - int mid = (left + right) / 2; - if (arr[mid] < arr[mid + 1]) - left = mid + 1; - else - right = mid; - } - return left; - } -}; - -int main() { - Solution obj; - vector<int> a1 = {0, 1, 0}, a2 = {0, 2, 1, 0}, a3 = {0, 10, 5, 2}; - printf("%d\n", obj.peakIndexInMountainArray(a1)); // expect: 1 - printf("%d\n", obj.peakIndexInMountainArray(a2)); // expect: 1 - printf("%d\n", obj.peakIndexInMountainArray(a3)); // expect: 1 -} |