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 vote300 views1 answer
How to write a line in java
Java
1 vote294 views2 answers
Java system.out.println shortcut
Java
-1 vote253 views1 answer
Input 3 int 1 line in java
Java
4 votes260 views2 answers
Dfhgodjfgiojdfiojgjkdhjbsdv JKNJZXcnmvmcvbpdfh
Java
0 vote298 views2 answers
Detect bluetooth headphones android programmatically
Java
0 vote267 views1 answer
Foreign keys in json
Java
5 votes264 views2 answers
Java how to initialize an array
Java
1 vote300 views1 answer
Loop Structure in Java
Java
-1 vote264 views1 answer
Java GraphicsOperations.drawLine
Java
3 votes282 views2 answers
Android round double to 2 decimal
Java