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

8 votes287 views1 answer
Intent in fragment android
Java
0 vote340 views1 answer
GetMapping("/rest/v1/books") in spring rest api
Java Spring
24 votes283 views6 answers
Java string to int
Java
0 vote328 views1 answer
Trivers json node as node type
Java
2 votes294 views1 answer
Android check if app is running
Java
0 vote306 views1 answer
Setbackground color hexadecimal android
Java
5 votes304 views2 answers
Math.absolute java
Java
1 vote282 views1 answer
Exponential in java
Java
0 vote318 views1 answer
What is returned by a producer.send() call in the Java API? A boolean indicating if the call succeeded Future object Future object Unit
Java
11 votes260 views1 answer
Age in java
Java