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

3 votes203 views2 answers
Java dictionary foreach
Java
0 vote184 views1 answer
Duplicate class com.google.common.util.concurrent.ListenableFuture found in modules jetified-guava-24.1-jre (com.google.guava:guava:24.1-jre) and jetified-listenablefuture-1.0 (com.google.guava:listenablefuture:1.0)
Java
3 votes245 views1 answer
Assert system.out.println
Java
1 vote211 views3 answers
Change drawable color programmatically android
Java
4 votes212 views3 answers
Current currency rates api
Java
29 votes202 views5 answers
String reverse in java
Java
4 votes180 views1 answer
Properties java 8 maven in pom xml
Java
1 vote185 views1 answer
Java lombok constructor inject guice
Java
0 vote182 views2 answers
Java LinkedList
Java
20 votes193 views2 answers
String.replace in java
Java