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

2 votes334 views1 answer
Django setup allowed hosts
Python
1 vote340 views1 answer
Python typing optional
Python
1 vote316 views1 answer
Add text toimage cv2
Python
0 vote354 views1 answer
What is the purpose of open ( ) and close ( ) in os
Python
4 votes350 views2 answers
Python print time difference
Python
0 vote330 views1 answer
Python list of dict change dicts id by position in list when moved
Python
0 vote412 views1 answer
Last executed query in flask api
Python Flask
0 vote332 views1 answer
Random night stars with python turtle
Python
-1 vote332 views1 answer
Extract DATE from pandas
Python
0 vote326 views2 answers
Is login a class in python
Python