Mountain array leetcode

class Solution:
    def peakIndexInMountainArray(self, arr: List[int]) -> int:
        start = 0
        end = len(arr)-1
        
        while (start < end):
            mid = start + (end-start)//2
            if (arr[mid]>arr[mid+1]):
                end = mid
            else: start = mid+1
        return start

Mountain array leetcode

class Solution {    
    public static int peakIndexInMountainArray(int[] arr) {
        int start = 0;
        int end = arr.length-1;

        while(start < end){
            int mid = start + (end-start)/2;

            if (arr[mid] > arr[mid+1]) end = mid;
            else start = mid+1;
        }
        return start;
    }
}

Similar codes

0 vote347 views1 answer
Mypy clear cache
Python
0 vote391 views1 answer
Get opnly second part of multiindex
Python
1 vote337 views1 answer
Change index function for class python
Python
7 votes360 views2 answers
Show image in python
Python
0 vote294 views6 answers
Convert from python code to c++ code
Python
0 vote346 views2 answers
Python youtube view bot
Python
16 votes315 views2 answers
Python reimport module
Python
-3 votes335 views1 answer
Django socketio web chat example
Python
1 vote389 views1 answer
Python match phone number
Python
3 votes373 views3 answers
Python codes
Python