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 vote284 views1 answer
Get distance from latitude and longitude code android
Java
0 vote261 views1 answer
How do you nuke japan
Java
3 votes336 views3 answers
Radiogroup get selected item android
Java
16 votes265 views3 answers
Android java double to string
Java
0 vote276 views1 answer
Java application
Java
0 vote293 views1 answer
Javafx access fxml elements
Java
0 vote286 views1 answer
Natural log in java
Java
0 vote284 views1 answer
Access denied finding property "camera.aux.packagelist"
Java
0 vote291 views1 answer
Scaletype android dynamic
Java
0 vote285 views1 answer
Add integers java
Java