Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- class Solution {
- public:
- int peakIndexInMountainArray(vector<int>& A) {
- int l,r,mid;
- l=0;
- r=A.size()-1;
- while (r-l>1) {
- mid=(l+r)/2;
- if (A[mid]<A[mid+1]) l=mid; else r=mid;
- }
- if (A[l]>A[r]) return l; else return r;
- // время - log(A.size())
- // память - O(1)
- }
- };
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement