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 vote324 views1 answer
Discord failed to install mac
Java
0 vote303 views1 answer
Android list tostring
Java
0 vote344 views1 answer
UserRedirectRequiredException: A redirect is required to get the users approval spring boot 5 security
Java
0 vote352 views1 answer
How to clear a text file in java
Java
2 votes296 views2 answers
Java implement multiple interfaces
Java
2 votes335 views2 answers
Split each character in a string (java)
Java
2 votes487 views1 answer
Java put a char array into a string
Java
0 vote313 views1 answer
Android java how to stop activity from opening twice programatically
Java
0 vote311 views1 answer
Exitonclose swing
Java
9 votes328 views2 answers
Java input character
Java