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

1 vote332 views3 answers
Django reverse
Python Django
1 vote328 views2 answers
Python numpy delete element from array
Python
0 vote348 views1 answer
How to pull images from android device from usb in python
Python
0 vote313 views1 answer
Get every second elemnt of array matlab
Python
52 votes328 views4 answers
Get diroctary in python
Python
6 votes346 views1 answer
Python print return code of requests
Python
13 votes320 views3 answers
Pandas reset index start from 0
Python
0 vote330 views1 answer
Zoom in librosa.display.specshow()
Python
0 vote637 views1 answer
UserWarning: X does not have valid feature names, but LinearRegression was fitted with feature names
Python
0 vote317 views1 answer
Csv logger keras
Python